Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games
From MaRDI portal
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 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.
This page was built for publication: Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6329218)
