Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Preprint
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systemsAutomatica, 2016
- Distributed Nash equilibrium seeking: A gossip-based algorithmAutomatica, 2016
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communicationAutomatica, 2015
- Fully aggregative gamesEconomics Letters, 2012
- Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded DerivativesIEEE Transactions on Automatic Control, 2012
- Constrained Games: The Impact of the Attitude to Adversary's ConstraintsIEEE Transactions on Automatic Control, 2009
- Distributed Subgradient Methods for Multi-Agent OptimizationIEEE Transactions on Automatic Control, 2009
- Aggregative games and best-reply potentialsEconomic Theory, 2008
- An extension of duality to a game-theoretic frameworkAutomatica, 2007
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problemsMathematical Programming, 1992