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 distributed average tracking dynamics, and is applicable to games with constrained strategy sets and weight-balanced communication graphs. We obtain an exponential convergence of the proposed algorithm to the Nash equilibrium. Numerical examples illustrate the effectiveness of our methods.
@article{arxiv.1911.06458,
title = {Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games},
author = {Shu Liang and Peng Yi and Yiguang Hong and Kaixiang Peng},
journal= {arXiv preprint arXiv:1911.06458},
year = {2021}
}