Abstract
An aggregative game involving double-integrator agents is investigated. In this game, the dynamics of all players are subjected to unknown time-varying disturbances and unmodeled terms, and are also influenced by networked attacks on the communication topology. To seek a Nash equilibrium for such games, a novel distributed robust Nash equilibrium seeking algorithm is proposed and the complete closed-loop system is modeled as a hybrid system using an average dwell-time automaton and a time-ratio monitor to constrain attacks. Then, to analyze stability for the proposed algorithm, a Lyapunov function is constructed and uniform asymptotic stability is obtained under a local Lipschitz assumption on the gradients of the payoff functions. In addition, global uniform asymptotic stability is obtained under a global Lipschitz assumption on the gradients. Finally, an example is used to illustrate the results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
