Fully distributed attack-resilient Nash equilibrium seeking for networked games subject to DoS attacks

This paper is concerned with distributed Nash equilibrium seeking problem for networked games that may suffer from denial-of-service (DoS) attacks. A node-based fully distributed resilient strategy for Nash equilibrium seeking is presented, where the control gains of each player can be adaptively tuned based on its local adjacent information. Then, under this strategy, the Nash equilibrium seeking can be achieved without involving any global information, provided that some conditions of DoS attacks duration can be satisfied. Moreover, an edge-based fully distributed resilient Nash equilibrium seeking strategy is presented, where an adaptive control gain is imposed on each communication link between neighbors. Finally, illustrative simulation case studies are conducted to validate the obtained results.