Distributed Nash Equilibrium Seeking in Multiagent Games Under Switching Communication Topologies.

Area of Science:

• Control Theory
• Game Theory
• Distributed Systems

Background:

• Multiagent systems require distributed methods for equilibrium seeking.
• Switching communication topologies and communication loss pose significant challenges.
• Existing methods may not be robust to dynamic network changes and data loss.

Purpose of the Study:

• To develop a distributed Nash equilibrium seeking strategy for multiagent games.
• To address scenarios with switching communication topologies, including those with communication loss.
• To analyze convergence properties for both quadratic and nonquadratic games.

Main Methods:

• Synthesis of a leader-following consensus protocol and gradient play.
• Analysis under switching topologies with and without communication loss.
• Separate treatment of nonquadratic and quadratic game types.

Main Results:

• Achieved distributed Nash equilibrium seeking under dynamic and lossy communication.
• Established local convergence for nonquadratic games.
• Established nonlocal convergence for quadratic games.

Conclusions:

• The proposed distributed strategy is effective for Nash equilibrium seeking in challenging network conditions.
• The method demonstrates robustness against switching topologies and communication failures.
• Theoretical findings are validated through numerical simulations.