Robust Consensus of Networked Evolutionary Games with Attackers and Forbidden Profiles ^†

Area of Science:

• Control Theory
• Networked Systems
• Game Theory

Background:

• Networked evolutionary games (NEGs) are crucial for modeling strategic interactions in distributed systems.
• Ensuring robust consensus under adversarial conditions and constraints is a significant challenge in NEGs.
• Existing methods may not adequately address the combined complexities of attackers and forbidden profiles.

Purpose of the Study:

• To develop a framework for analyzing and controlling robust consensus in NEGs with attackers and forbidden profiles.
• To establish conditions for robust constrained reachability in such systems.
• To design effective state feedback controls for achieving robust consensus.

Main Methods:

• Utilizing an algebraic state space representation to model NEGs with attackers and forbidden profiles.
• Deriving a necessary and sufficient condition for robust constrained reachability.
• Constructing robust reachable sets and proposing a constructive control design procedure.

Main Results:

• An algebraic form for NEGs with attackers and forbidden profiles was established.
• A necessary and sufficient condition for robust constrained reachability was presented.
• A constructive procedure for designing state feedback controls for robust consensus was proposed.

Conclusions:

• The proposed method effectively addresses robust consensus in NEGs with attackers and forbidden profiles.
• The derived conditions and control design are validated through an illustrative example.
• This work contributes to the reliable design of networked evolutionary game systems.