Distributed Nash Equilibrium Seeking for Aggregative Games With Directed Communication Graphs
- 27 April 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 69 (8) , 3339-3352
Abstract
One key factor affecting the distributed Nash equilibrium (NE) seeking in aggregative games is the unbalanced communication structure for multiple players. Although some results on seeking NE over undirected or weight-balanced graphs were established, how to address the distributed NE seeking problem over general directed communication graphs is still an outstanding challenge. This paper addresses the NE seeking problem for a class of aggregative games with general directed communication graphs. To achieve this objective, two new kinds of distributed discrete-time NE seeking algorithms are developed for aggregative games over fixed digraphs and time-varying digraphs, respectively. In particular, motivated by the heavy-ball method in optimization studies, a momentum term is introduced to the update law of the players’ actions and it is numerically verified that this momentum term accelerates the convergence of the proposed algorithms. For both strongly connected fixed graph and $B$ -strongly connected time-varying graph, it is theoretically proved that the actions of players will converge to the NE of aggregative games for the case of decreasing step-size implemented by the proposed NE seeking algorithms if the cost functions and the aggregation of players satisfy some certain conditions. Finally, the developed NE seeking algorithms are applied to the energy consumption control of plug-in hybrid electric vehicles (PHEVs), which demonstrates the effectiveness of the theoretical results.Keywords
Funding Information
- National Natural Science Foundation of China (62073079, 62088101, 62003167)
This publication has 30 references indexed in Scilit:
- Private and Truthful Aggregative Game for Large-Scale Spectrum SharingIEEE Journal on Selected Areas in Communications, 2017
- Distributed Algorithms for Aggregative Games on GraphsOperations Research, 2016
- Game Design and Analysis for Price-Based Demand Response: An Aggregate Game ApproachIEEE Transactions on Cybernetics, 2016
- Global convergence of the Heavy-ball method for convex optimization2015
- Distributed Optimization Over Time-Varying Directed GraphsIEEE Transactions on Automatic Control, 2014
- Autonomous Demand Side Management Based on Energy Consumption Scheduling and Instantaneous Load Billing: An Aggregative Game ApproachIEEE Transactions on Smart Grid, 2014
- Game-Theoretic Methods for the Smart Grid: An Overview of Microgrid Systems, Demand-Side Management, and Smart Grid CommunicationsIEEE Signal Processing Magazine, 2012
- Distributed Stochastic Subgradient Projection Algorithms for Convex OptimizationJournal of Optimization Theory and Applications, 2010
- Existence and Uniqueness of Equilibrium Points for Concave N-Person GamesEconometrica, 1965
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964