Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHuman behavior in Prisoners Dilemma experiments suppresses network reciprocity
230
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoners Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks the observed level of cooperation is the same. We thus show that when human subjects interact in an heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.
rate research
Read More
The conventional wisdom is that scale-free networks are prone to cooperation spreading. In this paper we investigate the cooperative behaviors on the structured scale-free network. On the contrary of the conventional wisdom that scale-free networks are prone to cooperation spreading, the evolution of cooperation is inhibited on the structured scale-free network while performing the prisoners dilemma (PD) game. Firstly, we demonstrate that neither the scale-free property nor the high clustering coefficient is responsible for the inhibition of cooperation spreading on the structured scale-free network. Then we provide one heuristic method to argue that the lack of age correlations and its associated `large-world behavior in the structured scale-free network inhibit the spread of cooperation. The findings may help enlighten further studies on evolutionary dynamics of the PD game in scale-free networks.
The paradox of cooperation among selfish individuals still puzzles scientific communities. Although a large amount of evidence has demonstrated that cooperator clusters in spatial games are effective to protect cooperators against the invasion of defectors, we continue to lack the condition for the formation of a giant cooperator cluster that assures the prevalence of cooperation in a system. Here, we study the dynamical organization of cooperator clusters in spatial prisoners dilemma game to offer the condition for the dominance of cooperation, finding that a phase transition characterized by the emergence of a large spanning cooperator cluster occurs when the initial fraction of cooperators exceeds a certain threshold. Interestingly, the phase transition belongs to different universality classes of percolation determined by the temptation to defect $b$. Specifically, on square lattices, $1<b<4/3$ leads to a phase transition pertaining to the class of regular site percolation, whereas $3/2<b<2$ gives rise to a phase transition subject to invasion percolation with trapping. Our findings offer deeper understanding of the cooperative behaviors in nature and society.
We study the evolution of cooperation in spatial Prisoners dilemma games with and without extortion by adopting aspiration-driven strategy updating rule. We focus explicitly on how the strategy updating manner (whether synchronous or asynchronous) and also the introduction of extortion strategy affect the collective outcome of the games. By means of Monte Carlo (MC) simulations as well as dynamical cluster techniques, we find that the involvement of extortioners facilitates the boom of cooperators in the population (and whom can always dominate the population if the temptation to defect is not too large) for both synchronous and asynchronous strategy updating, in stark contrast to the otherwise case, where cooperation is promoted for intermediate aspiration level with synchronous strategy updating, but is remarkably inhibited if the strategy updating is implemented asynchronously. We explain the results by configurational analysis and find that the presence of extortion leads to the checkerboard-like ordering of cooperators and extortioners, which enable cooperators to prevail in the population with both strategy updating manners. Moreover, extortion itself is evolutionary stable, and therefore acts as the incubator for the evolution of cooperation.
The Prisoners Dilemma game has a long history stretching across the social, biological, and physical sciences. In 2012, Press and Dyson developed a method for analyzing the mapping of the 8-dimensional strategy profile onto the 2-dimensional payoff space in an infinitely iterated Prisoners Dilemma game, based on Markov chain analysis and memory-one strategies. We generalize this approach and introduce the concept of strategy parameter to show that linear relations among player payoffs are a ubiquitous feature of the infinitely iterated Prisoners Dilemma game. Our extended analysis is applied to various strategy profiles including tit-for-tat, win-stay-lose-shift, and other randomized strategy sets. Strategy profiles are identified that map onto the vertices, edges, and interior of the Prisoners Dilemma quadrilateral in the 2-dimensional payoff (score) space. A DaMD strategy is defined based solely on Defection after Mutual Defection and leads to linear relations between player scores using strategy parameter analysis. The DaMD strategy is shown to result in an equal (reciprocal) or larger (extortive) score for its user compare to the other player, independent of the strategy of the other player. The extortive scores occur when the probabilities for the DaMD player to cooperate after conflicting plays (cooperate-defect or defect-cooperate) sum to less than 1. The equal reciprocal scores occur when the probabilities for the DaMD player to cooperate after conflicting plays (cooperate-defect or defect-cooperate) sum to 1. When one player selects the extortive DaMD, the opposing player can force the equal punishment payoffs for both players in the infinitely iterated Prisoners dilemma by also choosing the DaMD strategy. Possible pathways to mutual cooperation based on DaMD are discussed.
We address the problem of how the survival of cooperation in a social system depends on the motion of the individuals. Specifically, we study a model in which Prisoners Dilemma players are allowed to move in a two-dimensional plane. Our results show that cooperation can survive in such a system provided that both the temptation to defect and the velocity at which agents move are not too high. Moreover, we show that when these conditions are fulfilled, the only asymptotic state of the system is that in which all players are cooperators. Our results might have implications for the design of cooperative strategies in motion coordination and other applications including wireless networks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
