Distributed GNE seeking under partial-decision information over networks via a doubly-augmented operator splitting approach
arXiv:1808.04465 · doi:10.1109/TAC.2019.2922953
Abstract
We consider distributed computation of generalized Nash equilibrium (GNE) over networks, in games with shared coupling constraints. Existing methods require that each player has full access to opponents' decisions. In this paper, we assume that players have only partial-decision information, and can communicate with their neighbours over an arbitrary undirected graph. We recast the problem as that of finding a zero of a sum of monotone operators through primal-dual analysis. To distribute the problem, we doubly augment variables, so that each player has local decision estimates and local copies of Lagrangian multipliers. We introduce a single-layer algorithm, fully distributed with respect to both primal and dual variables. We show its convergence to a variational GNE with fixed step-sizes, by reformulating it as a forward-backward iteration for a pair of doubly-augmented monotone operators.
arXiv comment12 pages, 5 figures. This work has been submitted to the IEEE for possible publication
References in corpus (8)
- A Passivity-Based Approach to Nash Equilibrium Seeking over Networks
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- A distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods
- Dynamic control of agents playing aggregative games with coupling constraints
- Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control
- Distributed Nash Equilibrium Seeking under Partial-Decision Information via the Alternating Direction Method of Multipliers
- Distributed Learning for Stochastic Generalized Nash Equilibrium Problems
- Distributed generalized Nash equilibria computation of monotone games via a preconditioned proximal point algorithm
Cited by in corpus (13)
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- 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
- 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
- Distributed Nash Equilibrium Seeking for Monotone Generalized Noncooperative Games by a Regularized Penalty Method
- A distributed generalized Nash equilibrium seeking algorithm based on extremum seeking control
- Nash equilibrium seeking under partial-decision information over directed communication networks
- A fully-distributed proximal-point algorithm for Nash equilibrium seeking with linear convergence rate
- Incentives and co-evolution: Steering linear dynamical systems with noncooperative agents
- Non-Euclidean Monotone Operator Theory with Applications to Recurrent Neural Networks
- Efficient Distributed Learning in Stochastic Non-cooperative Games without Information Exchange