Distributed Resilient Nash Equilibrium Seeking for Aggregative Games of Second‐Order Systems Under Dos Attacks

ABSTRACT This paper investigates the distributed Nash equilibrium seeking problem for aggregative games over a second‐order multi‐agent network subject to denial‐of‐service (DoS) attacks. To solve this problem, a novel distributed algorithm is designed based on state estimation and adaptive gains, where each player can estimate the information of other nodes under DoS attacks. Then, the convergence of this algorithm is analyzed by the Lyapunov method and switched system theory. Furthermore, this algorithm overcomes the challenge caused by time‐varying topologies resulting from DoS attacks. Finally, a simulation example is presented to confirm the validity and correctness of the distributed algorithm designed in this paper.