.png){kind=icon}
.png){kind=icon}
Return
Distributed Nash Equilibrium Seeking for Multicluster Game Under Switching Communication Topologies
.png){kind=icon}
PRE
AI
X
F
Z
DOI：10.1109/TSMC.2021.3090515.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we investigate the distributed Nash equilibrium (NE) seeking problem for the multi-cluster game under switching communication topologies. Specifically, the communication topology switches between a group of jointly connected digraphs. First, a new distributed NE seeking algorithm for the multi-cluster games is designed by the consensus protocol and gradient play rule under the switching communication topologies. Furthermore, in order to make the algorithm still applicable when the agent only knows part of the decision information, the leader-following consensus protocol is used to generate the estimates for all agents action in the cluster under the assumption that the switching topology between clusters is directed and strongly connected. A more general NE seeking algorithm for the multi-cluster games is designed. For these two algorithms, the results of local convergence and non-local convergence are given, respectively. Two examples verify the validity of the theoretical results.
Keywords:
Games
Topology
Switches
Network topology
Clustering algorithms
Cost function
Convergence
Distributed algorithm
multi-cluster game
Nash equilibrium (NE) seeking
switching topology
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers