Abstract
An aggregative game with local constraint sets is studied in this paper, where each player's cost function is dependent on the aggregation function that is unavailable to all players. To compute the Nash equilibrium (NE) point of the game in a distributed manner, the players are endowed with several auxiliary state variables that are used to estimate the aggregation function by exchanging their estimates with local neighbors on a directed graph. In the two cases with strongly connected weight-balanced and -unbalanced communication graphs, respectively, NE seeking strategies are proposed by the interconnection of projected gradient-play with average consensus dynamics. The proposed algorithms are proved to be able to reach the NE point by using tools from variational inequality theory and Lyapunov stability theory. Finally, an example is simulated to demonstrate the theoretical results.
Funding Information
  • National Natural Science Foundation of China (61673104, 61673107)
  • National Ten Thousand Talent Program for Young Top-Notch Talents (W2070082)
  • Jiangsu Provincial Key Laboratory of Networked Collective Intelligence (BM2017002)
  • Six Talent Peaks of Jiangsu Province (2019-DZXX-006)
  • Fundamental Research Funds for the Central Universities (3207012001A3)
  • Equipment Advance Research Program of Ministry of Education (6141A020223)
  • Southeast University Zhongying Young Scholars
  • Hong Kong Research Grants Council (CityU 11234916)

This publication has 42 references indexed in Scilit: