Abstract
In this paper, we investigate the stability degree of profiles for a class of networked evolutionary games (NEGs) with switching topology using the semi-tensor product of matrices. Firstly, we calculate the algebraic form of NEGs with switching topology, whose strategy updating rule is myopic best response adjustment rule and network updating rule is voting principle. Secondly, the strong stability degree and weak stability degree of a profile are defined, and some necessary and sufficient conditions to detect whether a profile is strong or weak k−degree stable are provided. Furthermore, we propose the state feedback controller algorithms to guarantee that a profile is strong or weak k−degree stable, respectively. Finally, a numerical example is provided to illustrate the effectiveness of our results.
Sign-in/Register to access full text options 
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.
