![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
ABSTRACT
In this paper, we consider the Nash equilibrium (NE) seeking problem for aggregative games and design a distributed heavy-ball algorithm to solve it. This algorithm has faster convergence rate than the well-known distributed first-order algorithms for aggregative games. In order to seek the NE, each player needs to exchange information with its neighbours as well as a central aggregation. For aggregative games, the aggregative term can be either linear or nonlinear in this paper. Furthermore, we consider the generalised Nash equilibrium seeking problem for aggregative games by taking into account the linear coupled constraints among players, and modify our initial algorithm to include game constraints.
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Funding
Notes on contributors
Xu Yang
Xu Yang received the B. Sc. degree in statistics from Anhui Polytechnic University, China, in 2015. He is currently a master student in Nanchang University, China. His research interests include distributed games and distributed optimisation.
Wei Ni
Wei Ni received the Ph. D. degree in systems science from Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China, in 2010. He is currently an associate professor with School of Science, Nanchang University, China. His research interests include control of switched and impulsive systems, and complex systems.