Nash Equilibrium Seeking Over Directed Graphs
arXiv:2005.10495 · doi:10.1007/s43684-022-00026-2
Abstract
In this paper, we aim to develop distributed continuous-time algorithms over directed graphs to seek the Nash equilibrium in a noncooperative game. Motivated by the recent consensus-based designs, we present a distributed algorithm with a proportional gain for weight-balanced directed graphs. By further embedding a distributed estimator of the left eigenvector associated with zero eigenvalue of the graph Laplacian, we extend it to the case with arbitrary strongly connected directed graphs having possible unbalanced weights. In both cases, the Nash equilibrium is proven to be exactly reached with an exponential convergence rate. An example is given to illustrate the validity of the theoretical results.
arXiv comment13 pages
References in corpus (8)
- A Passivity-Based Approach to Nash Equilibrium Seeking over Networks
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Dynamic control of agents playing aggregative games with coupling constraints
- Real and Complex Monotone Communication Games
- Dynamic NE Seeking for Multi-Integrator Networked Agents with Disturbance Rejection
- Optimal Output Consensus for Nonlinear Multi-agent Systems with Both Static and Dynamic Uncertainties
- Distributed generalized Nash equilibria computation of monotone games via a preconditioned proximal point algorithm
- Empirical Centroid Fictitious Play: An Approach For Distributed Learning In Multi-Agent Games