Robust consensus of networked evolutionary games with attackers and forbidden profiles

Abstract

Using the algebraic state space representation, this paper studies the robust consensus of networked evolutionary games (NEGs) with attackers and forbidden profiles. Firstly, an algebraic form is established for NEGs with attackers and forbidden profiles. Secondly, based on the algebraic form, a necessary and sufficient condition is presented for the robust constrained reachability of NEGs. Thirdly, a series of robust reachable sets is constructed by using the robust constrained reachability, based on which a constructive procedure is proposed to design state feedback controls for the robust consensus of NEGs with attackers and forbidden profiles. Finally, an illustrative example is given to show that the main results are effective.