Abstract

In this paper, a detailed survey is presented for the analysis and control of networked evolutionary games via the matrix method. The algebraic form of networked evolutionary games is firstly recalled. Then, some existing results on networked evolutionary games are summarized. Furthermore, several generalized forms of networked evolutionary games are reviewed, including networked evolutionary games with time delay, networked evolutionary games with bankruptcy mechanism, networked evolutionary games with time-varying networks, and random evolutionary Boolean games. The computational complexity of general networked evolutionary games is still challenging, which limits the application of the matrix method to large-scale networked evolutionary games. Future works are finally presented in the conclusion.

Full Text
Published version (Free)

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 call