Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games

Shu Liang , Peng Yi , Yiguang Hong , Kaixiang Peng

Autonomous Intelligent Systems ›› 2022, Vol. 2 ›› Issue (1) : 6

PDF
Autonomous Intelligent Systems ›› 2022, Vol. 2 ›› Issue (1) : 6 DOI: 10.1007/s43684-022-00024-4
Original Article

Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games

Author information +
History +
PDF

Abstract

Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed. The algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics, and is applicable to games with constrained strategy sets and weight-balanced communication graphs. The key feature of our method is that the proposed projected dynamics achieves exponential convergence, whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium seeking. Numerical examples illustrate the effectiveness of our methods.

Cite this article

Download citation ▾
Shu Liang, Peng Yi, Yiguang Hong, Kaixiang Peng. Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games. Autonomous Intelligent Systems, 2022, 2(1): 6 DOI:10.1007/s43684-022-00024-4

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

National Natural Science Foundation of China,(61903027)

AI Summary AI Mindmap
PDF

201

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/