Abstract
Networked evolutionary games (NEGs) are a class of models that capture the interactions and evolution of strategies among rational agents in a network. In this paper, we study the problem of minimum cost control of NEGs with switched topologies and threshold, where the network structure can change over time and the agents have a minimum payoff requirement to survive. Using the semi-tensor product (STP) of matrices, we express the weighted networked evolutionary game in an algebraic form. Then, we propose an efficient algorithm to design the minimum cost control that ensures the survival of the agents. Finally, we demonstrate the validity of our theoretical results with an example and simulations.
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.
