Network Games: Condensation of the Graph as a Hierarchical interpretation of the Game

Giacomo Casadei (1) , Carlos Canudas de Wit (1)

1 NECS - Networked Controlled Systems

In this paper we investigate the problem of optimal games played over networks and focus our attention on the importance of the topology of communication between the agents. We consider a set of agents which are connected via a directed communication graph: each agent in the network has to optimize a local cost function which depends on the agent's decision and on the decision taken by the set of its neighbors, giving rise to a Network Game. We show that, by condensing the strongly connected components of the control graph into super-nodes, it is possible to give a hierarchical interpretation to the Network Game. Then we apply the proposed architecture to the case of a large scale network which takes inspiration by traffic networks application.

Mots clés: Graph Theory; Network Games; Aggregation over Networks; Control of Networks

Domaines: Automatique / Robotique

Giacomo Casadei, Carlos Canudas de Wit. Network Games: Condensation of the Graph as a Hierarchical interpretation of the Game. IFAC WC 2017 - 20th IFAC World Congress, IFAC, Jul 2017, Toulouse, France. pp.9655-9660. ⟨hal-01561947⟩