Abstract
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.
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.
