Distributed continuous-time algorithm for Nash equilibrium seeking of nonsmooth aggregative games
LIANG Yin-shan
LIANG Shu
HONG Yi-guang
Abstract：This paper studies distributed algorithm design for multi-agent aggregative games, where the cost functions of agents are nonsmooth. A distributed continuous-time algorithm is proposed whereby each agent can reach the Nash equilibrium by using local data and local information exchange. The convergence of the algorithm is proved by virtue of Lyapunov method. Furthermore, the generalized Nash equilibrium seeking problem for games with coupled inequality constraints is investigated. Simulations illustrate the effectiveness of our method.
Keywords：game theoryNash equilibriumdistributed algorithmcontinuous-time algorithmnonsmoothness
Publication Date：2018-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：8( 593-600 )