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

• Published in: Information sciences Vol. 641; p. 119080
• Main Authors: Qian, Cheng, Ding, Lei
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.09.2023
• Subjects: Adaptive gains; DoS attacks; Fully distributed strategies; Games; Nash equilibrium seeking; DoS attacks; Nash equilibrium seeking; Fully distributed strategies; Adaptive gains; Games
• ISSN: 0020-0255; 1872-6291
• DOI: 10.1016/j.ins.2023.119080

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. •Develop fully distributed resilient Nash equilibrium seeking strategies for networked games subject to DoS attacks.•Propose both the node-based and edge-based adaptive methods to ensure the convergence to Nash equilibrium.•Characterize the effects of DoS attacks on the convergence of the proposed Nash equilibrium seeking strategies.