Aspiration can promote cooperation in well-mixed populations as in regular graphs
arXiv:2005.03421 · doi:10.1007/s13235-020-00368-7
Abstract
Classical studies on aspiration-based dynamics suggest that a dissatisfied individual changes strategy without taking into account the success of others. This promotes defection spreading. The imitation-based dynamics allow individuals to imitate successful strategies without taking into account their own-satisfactions. In this article, we propose to study a dynamic based on aspiration which takes into account imitation of successful strategies for dissatisfied individuals. This helps cooperative members to resist. Individuals compare their success to their desired satisfaction level before making a decision to update their strategies. This mechanism helps individuals with a minimum of self-satisfaction to maintain their strategies. If an individual is dissatisfied, it will learn from others by choosing successful strategies. We derive an exact expression of the fixation probability in well-mixed populations as in structured populations in networks. As a result, we show that selection may favor cooperation more than defection in well-mixed populations as in populations ranged over a regular graph. We show that the best scenario is a graph with small connectivity.
References in corpus (7)
- Evolutionary prisoner's dilemma game on a square lattice
- Human strategy updating in evolutionary games
- Heterogeneous aspirations promote cooperation in the prisoner's dilemma game
- Evolutionary games in the multiverse
- Universality of weak selection
- Aspiration Dynamics of Multi-player Games in Finite Populations
- Strategy abundance in 2x2 games for arbitrary mutation rates
Cited by in corpus (3)
- Sensitivity-Driven Migration and the Evolution of Cooperation in Multi-Player Games on Structured Populations
- Multiplayer games on regular graphs under aspiration-driven imitation: Fixation probabilities and the dilution principle
- Stationary analysis of adaptive aspiration dynamics in graph-structured games