Distributed Nash Equilibrium Seeking under Partial-Decision Information via the Alternating Direction Method of Multipliers
arXiv:1707.01965 · doi:10.1016/j.automatica.2019.01.012
Abstract
In this paper, we consider the problem of finding a Nash equilibrium in a multi-player game over generally connected networks. This model differs from a conventional setting in that players have partial information on the actions of their opponents and the communication graph is not necessarily the same as the players' cost dependency graph. We develop a relatively fast algorithm within the framework of inexact-ADMM, based on local information exchange between the players. We prove its convergence to Nash equilibrium for fixed step-sizes and analyze its convergence rate. Numerical simulations illustrate its benefits when compared to a consensus-based gradient type algorithm with diminishing step-sizes.
References in corpus (1)
Cited by in corpus (14)
- Distributed GNE seeking under partial-decision information over networks via a doubly-augmented operator splitting approach
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate
- Single-timescale distributed GNE seeking for aggregative games over networks via forward-backward operator splitting
- Fast generalized Nash equilibrium seeking under partial-decision information
- A continuous-time distributed generalized Nash equilibrium seeking algorithm over networks for double-integrator agents
- Decentralized Online Learning for Noncooperative Games in Dynamic Environments
- On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
- A fully-distributed proximal-point algorithm for Nash equilibrium seeking with linear convergence rate
- Personalized incentives as feedback design in generalized Nash equilibrium problems
- Prescribed-Time Fully Distributed Nash Equilibrium Seeking in Noncooperative Games
- Attack-Resilient Distributed Algorithms for Exponential Nash Equilibrium Seeking
- Distributed Generalized Nash Equilibrium Seeking for Energy Sharing Games
- Networked Aggregative Games with Linear Convergence