Abstract

The subject of how and why cooperation emerges in real world has been intensively investigated. A number of mechanisms have been found to favor cooperation in ecological systems and human societies. Here, we propose a win-switch-lose-stay strategy whose core lies in two aspects: (i) An individual, according to Fermi updating rule, first selects one neighbor stochastically from all its nearest neighbors to play the game to update its strategy of the first round, and memories the selected neighbor. (ii) The individual interacts with the selected neighbor in the last round if its accumulated payoff is lower than that of the selected neighbor, otherwise the selected neighbor randomly switches to another of its rest neighbors. Other individuals also follow the updating rule and repeat this evolutionary process. Simulation results reveal that the proposed strategy can remarkably promote cooperation in several social dilemmas, including the prisoner’s dilemma, the snowdrift game and the stag-hunt game.

Full Text
Paper version not known

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

Disclaimer: 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.