Nash equilibrium seeking under partial-decision information over directed communication networks
arXiv:2009.04981 · doi:10.1109/CDC42340.2020.9304267
Abstract
We consider the Nash equilibrium problem in a partial-decision information scenario. Specifically, each agent can only receive information from some neighbors via a communication network, while its cost function depends on the strategies of possibly all agents. In particular, while the existing methods assume undirected or balanced communication, in this paper we allow for non-balanced, directed graphs. We propose a fully-distributed pseudo-gradient scheme, which is guaranteed to converge with linear rate to a Nash equilibrium, under strong monotonicity and Lipschitz continuity of the game mapping. Our algorithm requires global knowledge of the communication structure, namely of the Perron-Frobenius eigenvector of the adjacency matrix and of a certain constant related to the graph connectivity. Therefore, we adapt the procedure to setups where the network is not known in advance, by computing the eigenvector online and by means of vanishing step sizes.
arXiv commentTo appear in the 59th Conference on Decision and Control (CDC 2020)
References in corpus (7)
- Distributed GNE seeking under partial-decision information over networks via a doubly-augmented operator splitting approach
- Distributed generalized Nash equilibrium seeking in aggregative games on time-varying networks
- Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate
- Fast generalized Nash equilibrium seeking under partial-decision information
- Empirical Centroid Fictitious Play: An Approach For Distributed Learning In Multi-Agent Games
- A continuous-time distributed generalized Nash equilibrium seeking algorithm over networks for double-integrator agents
- Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix