Search

Understanding the dynamic processes of a real game system requires an appropriate dynamics model, and rigorously testing a dynamics model is nontrivial. In our methodological research, we develop an approach to testing the validity of game dynamics models that considers the dynamic patterns of angular momentum and speed as measurement variables. Using Rock–Paper–Scissors (RPS) games as an example, we illustrate the geometric patterns in the experiment data. We then derive the related theoretical patterns from a series of typical dynamics models. By testing the goodness-of-fit between the experimental and theoretical patterns, we show that the validity of these models can be evaluated quantitatively. Our approach establishes a link between dynamics models and experimental systems, which is, to the best of our knowledge, the most effective and rigorous strategy for ascertaining the testability of evolutionary game dynamics models. [ABSTRACT FROM AUTHOR]

Abstract: We propose an elimination mechanism in the study of the evolutionary prisoner’s dilemma games on evolving networks. It assumes that after each round of playing, players whose payoffs are below a certain threshold will be eliminated from the game and the same number of new nodes will be added to the network to maintain the size of the network constant. Numerical results show that moderate values of elimination threshold can result in a maximum cooperation level in the evolutionary prisoner’s dilemma game. Moreover, the elimination mechanism can make the network structure evolve into a high heterogeneity in degree distribution, which is considered to be helpful in promoting cooperation in evolutionary games. The present study may provide new insight for understanding the evolution of cooperation in light of the law ‘survival of the fittest’ in nature. [Copyright &y& Elsevier]

Abstract: We investigate the impacts of migration on the evolutionary game dynamics in finite populations with community structures in the framework of evolutionary game theory. In contrast to deterministic dynamics, our model incorporates stochastic factors induced by the finite population size. Based on the analysis of the stationary distribution of the evolutionary process in the limit of rare mutations, we prove that it is most likely to find the population in the community where all individuals have the lower migration rate. Furthermore, we show that reducing the difference between the migration rates of distinct communities can increase the first hitting time to the homogeneous absorbing state and can prolong the coexistence time of different species, promoting the conservation of biodiversity. [Copyright &y& Elsevier]

Abstract: We introduce a stochastic win-stay-lose-shift (WSLS) mechanism into evolutionary Prisoner’s Dilemma on small-world networks. At each time step, after playing with all its immediate neighbors, each individual gets a score to evaluate its performance in the game. The score is a linear combination of an individual’s total payoff (i.e., individual gain from the group) and local contribution to its neighbors (i.e., individual donation to the group). If one’s actual score is not larger than its desired score aspiration, it switches current strategy to the opposite one with the probability depending on the difference between the two scores. Under this stochastic WSLS regime, we assume that each focal individual gains its fixed score aspiration under the condition of full cooperation in its neighborhood, and find that cooperation is significantly enhanced under some certain parameters of the model by studying the evolution of cooperation. We also explore the influences of different values of learning rate and intensity of deterministic switch on the evolution of cooperation. Simulation results show that cooperation level monotonically increases with the relative weight of the local contribution to the score. For much low intensity of deterministic switch, cooperation is to a large extent independent of learning rate, and full cooperation can be reached when relative weight is not less than 0.5. Otherwise, cooperation level is affected by the value of learning rate. Besides, we find that the cooperation level is not sensitive to the topological parameters. To explain these simulation results, we provide corresponding analytical results based on mean-field approximation, and find out that simulation results are in close agreement with the analytical ones. Our work may be helpful in understanding the cooperative behavior in social systems based on this stochastic WSLS mechanism. [Copyright &y& Elsevier]

Abstract: We consider the coupled dynamics of the adaption of network structure and the evolution of strategies played by individuals occupying the network vertices. We propose a computational model in which each agent plays a n-round Prisoner''s Dilemma game with its immediate neighbors, after that, based upon self-interest, partial individuals may punish their defective neighbors by dismissing the social tie to the one who defects the most times, meanwhile seek for a new partner at random from the neighbors of the punished agent. It is found that the promotion of cooperation is attributed to the entangled evolution of individual strategy and network structure. Moreover, we show that the emerging social networks exhibit high heterogeneity and disassortative mixing pattern. For a given average connectivity of the population and the number of rounds, there is a critical value for the fraction of individuals adapting their social interactions, above which cooperators wipe out defectors. Besides, the effects of the average degree, the number of rounds, and the intensity of selection are investigated by extensive numerical simulations. Our results to some extent reflect the underlying mechanism promoting cooperation. [Copyright &y& Elsevier]

Abstract: We introduce a community network model which exhibits scale-free property and study the evolutionary Prisoner''s Dilemma game (PDG) on this network model. It is found that the frequency of cooperators decreases with the increment of the average degree from the simulation results. And reducing inter-community links can promote cooperation when we keep the total links (including inner-community and inter-community links) unchanged. It is also shown that the heterogeneity of networks does not always enhance cooperation and the pattern of links among all the vertices under a given degree-distribution plays a crucial role in the dominance of cooperation in the network model. [Copyright &y& Elsevier]

Abstract: In the realistic world, individual cautiousness can be often involved or observed when a rational individual makes a decision. However, it remains unclear how such individual cautiousness influences the evolution of cooperative behavior. To this end, we consider a Fermi strategy updating rule, where each individual is assigned a cautiousness index that controls its learning activity, and then study the evolution of cooperation in the spatial prisoner’s dilemma game. Interestingly, it is found that cooperation can be significantly promoted when individuals’ cautiousness is considered. In particular, there exists an optimal range of the degree of cautiousness resulting in the highest cooperation level. The remarkable promotion of cooperation, as well as the emerging phase transition is explained by configurational analysis. The sensitivity of cooperation to initial states with different fractions of cooperators is also discussed. The result illustrates that high densities of cooperators can be established at small initial fractions of cooperators. The detailed mechanism for such phenomenon is explained by analyzing the typical initial configurations. [Copyright &y& Elsevier]

Abstract: We investigate the effect of community structure on the evolution of cooperation in the prisoner’s dilemma and the snowdrift game with dynamical linking. We show both analytically and numerically that cooperators are generally more favorable on community networks than on networks without community structure, and in particular, there exists an optimal intermediate value of the model parameter leading to the easiest fixation of cooperators. We show that our results are robust with respect to the initial number of cooperators and are valid for a wide range of the ratio of time scales associated with linking and strategy dynamics. Since community structure is ubiquitous in real social networks, our results may provide new insights into the evolution of cooperation in real world. [ABSTRACT FROM AUTHOR]

Abstract: We investigate the evolutionary prisoner’s dilemma with memory-based agents on a square lattice. By introducing memory effects into this game, we assume that individuals’ performance is evaluated in terms of the accumulative payoffs in their memories. It is shown that if individuals behave as their successful neighbors, then cooperation can be significantly promoted. The mechanism responsible for the promotion of cooperation is discussed in detail. We confirm that the promotion of cooperation induced by memory effects remains effective when a preferential selection rule or an asynchronous updating rule is employed. Our work may shed some new light on the study of evolutionary games in real-world situations where the effects of individuals’ memories play a key role in the evolution of cooperation. [Copyright &y& Elsevier]