Fully Distributed Nash Equilibrium Seeking of Noncooperative Game Under DoS Attacks

This paper aims to investigate the fully distributed Nash equilibrium (NE) seeking problem in networked games under Denial of Service (DoS) attacks. A fully distributed NE seeking algorithm is proposed, specifically designed to be resilient against DoS attacks. In an environment where DoS attacks can impair network connectivity, existing NE algorithms may experience degraded performance or even failure. To seek NE in a distributed manner without relying on any global information, adaptive control gains are introduced and a topology-dependent adaptive protocol for switching topologies is designed. Moreover, an estimation-feedback-based distributed NE seeking algorithm is proposed. The exponential convergence to NE of the proposed algorithm is established under specific conditions regarding the duration of the DoS attacks. Finally, the effectiveness of the algorithm is validated by numerical simulations.