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
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01561947
Contributor : Giacomo Casadei <>
Submitted on : Thursday, July 13, 2017 - 1:39:14 PM
Last modification on : Saturday, July 28, 2018 - 1:14:57 AM
Document(s) archivé(s) le : Friday, January 26, 2018 - 5:53:03 PM

File

ifacconfVers3.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01561947, version 1

Collections

Citation

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

Share

Metrics

Record views

408

Files downloads

182