Distributed Nash equilibrium seeking for aggregative games via a small-gain approach
Preprint
Abstract
Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed. The algorithm is designed by virtue of projected gradient play dynamics and distributed average tracking dynamics, and is applicable to games with constrained strategy sets and weight-balanced communication graphs. We analyze the complex interaction of these dynamics with the help of input-to-state stability (ISS). By scaling algorithm parameters to render a small-gain condition, we obtain an exponential convergence of the proposed algorithm to the Nash equilibrium. In addition, a numerical example is provided to illustrate the effectiveness of our methods.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Exponential convergence of distributed primal–dual convex optimization algorithm without strong convexityAutomatica, 2019
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliersAutomatica, 2019
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster gameAutomatica, 2019
- An operator splitting approach for distributed generalized Nash equilibria computationAutomatica, 2019
- Distributed Nash equilibrium seeking for aggregative games with coupled constraintsAutomatica, 2017
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systemsAutomatica, 2016
- Network Flows That Solve Linear EquationsIEEE Transactions on Automatic Control, 2016
- Price-Based Coordinated Aggregation of Networked Distributed Energy ResourcesIEEE Transactions on Automatic Control, 2015
- Dynamic Incentives for Congestion ControlIEEE Transactions on Automatic Control, 2014
- Small-gain theorem for ISS systems and applicationsMathematics of Control, Signals, and Systems, 1994