Distributed Nash equilibrium seeking for aggregative games with coupled constraints

Abstract

In this paper, we study a distributed continuous-time design for aggregative games with coupled constraints in order to seek the generalized Nash equilibrium by a group of agents via simple local information exchange. To solve the problem, we propose a distributed algorithm based on projected dynamics and non-smooth tracking dynamics, even for the case when the interaction topology of the multi-agent network is time-varying. Moreover, we prove the convergence of the non-smooth algorithm for the distributed game by taking advantage of its special structure and also combining the techniques of the variational inequality and Lyapunov function.

8 pages, 4 figures

References in corpus (2)

• Initialization-free Distributed Algorithms for Optimal Resource Allocation with Feasibility Constraints and its Application to Economic Dispatch of Power Systems
• Game Design and Analysis for Price based Demand Response: An Aggregate Game Approach

Cited by in corpus (25)

• A distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods
• Distributed GNE seeking under partial-decision information over networks via a doubly-augmented operator splitting approach
• 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
• Semi-decentralized generalized Nash equilibrium seeking in monotone aggregative games
• Nash Equilibrium Seeking for General Linear Systems with Disturbance Rejection
• 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
• Decentralized Online Learning for Noncooperative Games in Dynamic Environments
• Nash Equilibrium Seeking Over Directed Graphs
• Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
• Prescribed-Time Fully Distributed Nash Equilibrium Seeking in Noncooperative Games
• Distributed Online Convex Optimization with an Aggregative Variable
• Distributed Aggregative Optimization over Multi-Agent Networks
• Attack-Resilient Distributed Algorithms for Exponential Nash Equilibrium Seeking
• Adaptive Approaches for Fully Distributed Nash Equilibrium Seeking in Networked Games
• A distributed algorithm for average aggregative games with coupling constraints
• No-regret distributed learning in subnetwork zero-sum games
• Distributed Generalized Nash Equilibrium Seeking of N-Coalition Games with Full and Distributive Constraints
• Privacy and Robustness Guarantees in Distributed Dynamics for Aggregative Games
• Efficient Distributed Learning in Stochastic Non-cooperative Games without Information Exchange
• Bayesian Nash Equilibrium Seeking for Distributed Incomplete-information Aggregative Games
• Differentially private Nash equilibrium seeking for networked aggregative games
• Online distributed algorithms for seeking generalized Nash equilibria in dynamic environments
• Distributed Generalized Nash Equilibrium Seeking for Energy Sharing Games