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 dy...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.展开更多
基金This work was partially supported by the National Natural Science Foundation of China under Grant 61903027,72171171,62003239Shanghai Municipal Science and Technology Major Project under Grant 2021SHZDZX0100Shanghai Sailing Program under Grant 20YF1453000.
文摘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.
