Semi-decentralized generalized Nash equilibrium seeking in monotone aggregative games

Abstract

We address the generalized Nash equilibrium seeking problem for a population of agents playing aggregative games with affine coupling constraints. We focus on semi-decentralized communication architectures, where there is a central coordinator able to gather and broadcast signals of aggregative nature to the agents. By exploiting the framework of monotone operator theory and operator splitting, we first critically review the most relevant available algorithms and then design two novel schemes: (i) a single-layer, fixed-step algorithm with convergence guarantee for general (non cocoercive, non-strictly) monotone aggregative games and (ii) a single-layer proximal-type algorithm for a class of monotone aggregative games with linearly coupled cost functions. We also design novel accelerated variants of the algorithms via (alternating) inertial and over-relaxation steps. Finally, we show via numerical simulations that the proposed algorithms outperform those in the literature in terms of convergence speed.

References in corpus (12)

• An inertial forward-backward algorithm for monotone inclusions
• Distributed Nash equilibrium seeking for aggregative games with coupled constraints
• Game Design and Analysis for Price based Demand Response: An Aggregate Game Approach
• A distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods
• Autonomous Demand Side Management Based on Energy Consumption Scheduling and Instantaneous Load Billing: An Aggregative Game Approach
• 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
• 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
• Distributed generalized Nash equilibria computation of monotone games via a preconditioned proximal point algorithm
• Inducing strong convergence of trajectories in dynamical systems associated to monotone inclusions with composite structure

Cited by in corpus (8)

• Operationally-Safe Peer-to-Peer Energy Trading in Distribution Grids: A Game-Theoretic Market-Clearing Mechanism
• Fast generalized Nash equilibrium seeking under partial-decision information
• Tracking-based distributed equilibrium seeking for aggregative games
• Receding Horizon Games with Coupling Constraints for Demand-Side Management
• Generalized Wardrop Equilibrium for Charging Station Selection and Route Choice of Electric Vehicles in Joint Power Distribution and Transportation Networks
• Distributed equilibrium seeking in aggregative games: linear convergence under singular perturbations lens
• Efficient Distributed Learning in Stochastic Non-cooperative Games without Information Exchange
• Bregman algorithms for mixed-strategy generalized Nash equilibrium seeking in a class of mixed-integer games