LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Robust Distributed Nash Equilibrium Seeking for Games Under Attacks and Communication Delays

In this article, a noncooperative game in which the engaged players are of double integrator-type dynamics, is investigated. The dynamics of the players are considered to be subject to unknown… Click to show full abstract

In this article, a noncooperative game in which the engaged players are of double integrator-type dynamics, is investigated. The dynamics of the players are considered to be subject to unknown time-varying disturbances and unmodeled terms. Besides, the communication topology among the players suffers from attacks and time-varying communication delays. To find a Nash equilibrium for such games, a distributed robust Nash equilibrium seeking algorithm is proposed. By utilizing average dwell-time and time-ratio constraints to tackle the attacks, the closed-loop system is modeled as a hybrid system with memory. To analyze the stability of the distributed switched algorithm, a Lyapunov functional is constructed, by which we show the uniform global asymptotic stability of the equilibrium. Finally, an example is given to illustrate our results.

Keywords: time; equilibrium; communication delays; nash equilibrium; equilibrium seeking

Journal Title: IEEE Transactions on Automatic Control
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.