Distributed Operator-Splitting Algorithm for Seeking GNE Aggregative Game
Authors: 
Lvming Fan, Huaqing Li, Songyang Li, Zhe Li, Lifeng Zheng, and Jun LiAuthors Info & Claims
Lvming Fan, Huaqing Li, Songyang Li, Zhe Li, Lifeng Zheng, and Jun LiAuthors Info & ClaimsMay 2023
Pages 291 - 296
Abstract
In this paper, we proposes a distributed algorithm to seek the generalized Nash equilibria (GNE) problem. We consider aggregative games with affine coupling constraint. In the game, the agent can only interact with neighboring agents. The cost of each agent depends on some aggregate effect of the actions of all the other agents, without the need for multiple communication between agents. The convergence of the algorithm is carried out by the transformation of consensus subspace and the invariance of aggregative estimation.
References
[1]
[1] Z. Ma, S. Zou, L. Ran, X. Shi, and I. Hiskens, “Efficient decentralized coordination of large-scale plug-in electric vehicle charging,” Automatica, vol. 69, pp. 35-47, 2016.
[2]
[2] M. Zhu and E. Frazzoli, “Distributed robust adaptive equilibrium computation for generalized convex games,” Automatica, vol. 97, pp. 186-188, 2016.
[3]
[3] M. Ye and G. Hu, “Game design and analysis for price-based demand response: An aggregate game approach,” IEEE Transactions on Cybernetics, vol. 47, no. 3, pp. 720-730, 2017.
[4]
[4] S. Grammatico, “Dynamic control of players playing aggregative games with coupling constraints,” IEEE Transactions on Automatic Control, vol. 62, no. 9, pp. 4537-4548, 2017.
[5]
[5] D. Paccagnan, B. Gentile, F. Parise, M. Kamgarpour and J. Lygeros, “Distributed computation of generalized Nash equilibria in quadratic aggregative games with affine coupling constraints,” in 55th IEEE Conference on Decision and Control (CDC), pp. 6123-6128, 2016.
[6]
[6] S. Grammatico, F. Parise, M. Colombino and J. Lygeros, “Decentralized convergence to Nash equilibria in constrained deterministic mean field control,” IEEE Transactions on Automatic Control, vol. 61, no. 11, pp. 3315-3329, 2016.
[7]
[7] L. Briceno-Arias and P. Combettes, “Monotone operator methods for Nash equilibria in non-potential games,” Comput. Analytical Math., pp. 143–159, 2013.
[8]
[8] F. Facchinei and J. Pang, “Finite-Dimensional Variational Inequalities and Complementarity Problems,” Springer, 2007.
[9]
[9] P. Yi and L. Pavel, “An operator splitting approach for dis- tributed generalized Nash equilibria computation,” Automatica, vol. 102, pp. 111-121, 2019.
[10]
[10] J. Lei, U. V. Shanbhag, J-S Pang and S. Sen, “On synchronous, asynchronous, and randomized best-response schemes for computing equilibria in Stochastic Nash games,” Mathematics of Operations Research, vol. 45, no. 1, 2017.
[11]
[11] P. Yi and L. Pavel, “Asynchronous distributed algorithms for seeking generalized Nash equilibria under full and partial decision information,” IEEE Transactions on Cybernetics, vol. 50, no. 6, pp. 2514–2526, 2019.
[12]
[12] S. Grammatico, “Dynamic control of agents playing aggregative games with coupling constraints,” EEE Transactions on Automatic Control, vol. 62, no. 9, pp. 4537–4548, Sep. 2017.
[13]
[13] G. Belgioioso and S. Grammatico, “Semi-decentralized Nash equilibrium seeking in aggregative games with separable coupling constraints and nondifferentiable cost,” IEEE Control Systems Letters, vol. 1, no. 2, pp. 400–405, Oct. 2017.
[14]
[14] D. Paccagnan, B. Gentile, F. Parise, M. Kamgarpour, and J. Lygeros, “Nash and Wardrop equilibria in aggregative games with coupling con- straints,” EEE Transactions on Automatic Control, vol. 64, no. 4, pp. 1373–1388, Apr. 2019.
[15]
[15] G. Belgioioso and S. Grammatico, “A Douglas–Rachford splitting for semi-decentralized equilibrium seeking in generalized aggregative games,” IEEE Conference on Decision and Control, 2018, pp. 3541–3546.
[16]
[16] J. Koshal, A. Nedi´c, and U. V. Shanbhag, “Distributed algorithms for aggregative games on graphs,” Operations Research, vol. 64, no. 3, pp. 680–704, 2016.
[17]
[17] D. Gadjov and L. Pavel, “Distributed GNE seeking over networks in aggregative games with coupled constraints via forward-backward operator splitting,” in Proc. IEEE 58th Conf. Decis. Control, 2019, pp. 5020–5025.
[18]
[18] Gadjov D, Pavel L, "Single-timescale distributed GNE seeking for aggregative games over networks via forward-backward operator splitting," IEEE Transactions on Automatic Control, PP. 99, 2020.
[19]
[19] P. Combettes and H. Bauschke, “Correction to: Convex Analysis and Monotone Operator Theory in Hilbert Spaces,” 2019
[20]
[20] Opial and Zdzisaw, “Weak convergence of the sequence of successive approximations for nonexpansive mappings,” Bulletin of the American Mathematical Society, vol. 73, no. 4, pp. 591-597, 1967.
Index Terms
- Distributed Operator-Splitting Algorithm for Seeking GNE Aggregative Game
Recommendations
Distributed Nash equilibrium seeking of aggregative games under networked attacks
AbstractThis paper investigates the distributed Nash equilibrium seeking problem of aggregative games in the presence of networked attacks. A switched algorithm with the fast estimate dynamics is proposed to explore the effect of attacks on seeking a Nash ...
Fast Convergence of Best-Reply Dynamics in Aggregative Games
We consider small-influence aggregative games with a large number of players n. For this class of games we present a best-reply dynamic with the following two properties. First, the dynamic reaches Nash approximate equilibria in quasi-linear in n number ...
Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players
AbstractThe aggregative games of multi-agent systems are studied in this paper, where the players have second-order nonlinear dynamics with uncertain parameters and the communication networks among the players are weight-balanced digraphs. In ...
Comments
Information & Contributors
Information
Published In
May 2023
1025 pages
ISBN:9798400700705
DOI:10.1145/3603781
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 July 2023
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- Nature Science Foundation of China
Conference
CNIOT'23
CNIOT'23: 2023 4th International Conference on Computing, Networks and Internet of Things
May 26 - 28, 2023
Xiamen, China
Acceptance Rates
Overall Acceptance Rate 39 of 82 submissions, 48%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 26Total Downloads
- Downloads (Last 12 months)26
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format