.png){kind=icon}
.png){kind=icon}
Return
Accelerated Nash equilibrium seeking algorithm with local memory for two-subnetwork zero-sum games
.png){kind=icon}
PRE
AI
DOI：10.1016/j.chaos.2025.117103.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Based on the gradient tracking method and local memory, we design a distributed discrete-time fixed-stepsize Nash equilibrium seeking algorithm for the two-subnetwork zero-sum game. • We weaken the requirement for the communication compared to the existing distributed discrete-time algorithms for the two-subnetwork zero-sum game. • The convergence speed of proposed algorithm is faster than that of the existing distributed discrete-time algorithms for the two-subnetwork zero-sum game.
Keywords:
gradient tracking
distributed algorithm
Nash equilibrium
zero-sum game
convergence speed
Journal
C
IF:
5.6
Papers:
1.3K
Citations:
3.8W