Distributed Nash Equilibrium Seeking for Aggregative Games over Weight-Unbalanced Digraphs. Issue 3 (2022)

• Record Type: Journal Article
• Authors: Wang, Dong; Chen, Pan; Chen, Mingfei; Lian, Jie; Wang, Wei
• Is Part Of: IFAC-PapersOnLine. Volume 55:Issue 3(2022)
• Page Start: 90
• Page End: 95
• Publication Date: 2022
• Subjects: Distributed algorithm -- aggregative games -- coupling constraints -- digraphs; Automatic control -- Periodicals; 629.805
• DOI: 10.1016/j.ifacol.2022.05.016
• Languages: English
• ISSNs: 2405-8963

Abstract

Abstract: This paper investigates a Nash equilibrium seeking problem of aggregative games with linear coupling constraints, where the cost function of each player is coupled through an aggregative function. All players seek the Nash equilibrium by exchanging decision information with neighbors over strongly connected and weight-unbalanced digraphs. A novel distributed continuous-time algorithm is designed by using the Lagrangian multiplier method and the dynamic average consensus method. Then, we show exponential convergence of the designed algorithm by utilizing stability theory of nonlinear systems. Finally, a numerical simulation is provided to verify the effectiveness of our algorithm.