Tracking-based distributed equilibrium seeking for aggregative games

Abstract

We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent, (i) the projected pseudo-gradient descent and (ii) a tracking mechanism to locally reconstruct the aggregative variable. To handle coupling constraints arising in generalized settings, we propose another distributed algorithm based on (i) a recently emerged augmented primal-dual scheme and (ii) two tracking mechanisms to reconstruct, for each agent, both the aggregative variable and the coupling constraint satisfaction. Leveraging tools from singular perturbations analysis, we prove linear convergence to the Nash equilibrium for both schemes. Finally, we run extensive numerical simulations to confirm the effectiveness of our methods and compare them with state-of-the-art distributed equilibrium-seeking algorithms.

References in corpus (12)

• 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
• Real and Complex Monotone Communication Games
• Distributed generalized Nash equilibrium seeking in aggregative games on time-varying networks
• Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control
• On the Exponential Stability of Primal-Dual Gradient Dynamics
• Nash and Wardrop equilibria in aggregative games with coupling constraints
• Single-timescale distributed GNE seeking for aggregative games over networks via forward-backward operator splitting
• Fast generalized Nash equilibrium seeking under partial-decision information
• Lyapunov Theory for Discrete Time Systems
• Semi-decentralized generalized Nash equilibrium seeking in monotone aggregative games
• Probably Approximately Correct Nash Equilibrium Learning

Cited by in corpus (3)

• ADMM-Tracking Gradient for Distributed Optimization over Asynchronous and Unreliable Networks
• Distributed equilibrium seeking in aggregative games: linear convergence under singular perturbations lens
• Existence of Solutions for Non-monotone Variational Inequalities and Implications for Games