Abstract
As Part 2 of the paper “on networked evolutionary games”, this paper uses the framework presented in Part 1 (Qi et al., 2014) to explore further issues about networked evolutionary games (NEGs). First, the strategy profile dynamics (SPD) is constructed from the fundamental evolutionary equations (FEEs). Using SPD, the control of NEGs are investigated. Detailed mathematical models are obtained for both deterministic and dynamic cases respectively. Then certain more complicated NEGs are explored. They are: (i) NEG with strategies of different length information, which allows some players use longer history information such as the information at t and t – 1 or so; (ii) NEG with Multi-Species, which allows an NEG with various kinds of players, they play several different fundamental network games according to their identities. (iii) NEG with time-varying payoffs. Since payoffs determine the evolution, the network profile dynamics will be a time-varying one. These more complicated NEGs can cover more general evolutions and they generalized the method proposed in Cheng et al. (Preprint2013).
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.
