Evolution of cooperation in the spatial public goods game with the third-order reputation evaluation

In this letter, in order to deeply explore the role of individual reputation in the evolutionary game dynamics, we present a new third-order reputation evaluation model to discuss the evolution of cooperation in the spatial public goods game. In the current model, we should not only consider the strategy (cooperation, C or defection, D) of a focal player, but also take his own reputation and his opponent's reputation status into account. Among them, the individual reputation will be divided into being good and bad according to the specified threshold, and the good player will be endowed with the more influential strategy transfer ability, which further helps to create the clusters of cooperative and good players within the population and then fosters the cooperation. A large plethora of experimental simulation results indicate that four rules under the third-order reputation mechanism can lead to the promotion of cooperation when compared to the traditional public goods game model. The current work is conductive to a better understanding of the persistence and emergence of collective cooperation in real-world systems.     

An Improved Fitness Evaluation Mechanism with Memory in Spatial Prisoner's Dilemma Game on Regular Lattices

To deeply understand the emergence of cooperation in natural,social and economical systems,we present an improved fitness evaluation mechanism with memory in spatial prisoner's dilemma game on regular lattices.In our model,the individual fitness is not only determined by the payoff in the current game round,but also by the payoffs in previous round bins.A tunable parameter,termed as the memory strength(μ),which lies between 0 and 1,is introduced into the model to regulate the ratio of payoffs of current and previous game rounds in the individual fitness calculation.When μ = 0,our model is reduced to the standard prisoner's dilemma game;while μ = 1 represents the case in which the payoff is totally determined by the initial strategies and thus it is far from the realistic ones.Extensive numerical simulations indicate that the memory effect can substantially promote the evolution of cooperation.For μ 1,the stronger the memory effect,the higher the cooperation level,but μ = 1 leads to a pathological state of cooperation,but can partially enhance the cooperation in the very large temptation parameter.The current results are of great significance for us to account for the role of memory effect during the evolution of cooperation among selfish players.     

Integrating neighborhoods in the evaluation of fitness promotes cooperation in the spatial prisoner’s dilemma game

A fundamental question of human society is the evolution of cooperation. Many previous studies explored this question via setting spatial background, where players obtain their payoffs by playing game with their nearest neighbors. Another undoubted fact is that the environment plays an important role in the individual development. Inspired by these phenomena, we reconsider the definition of individual fitness which integrates the environment, denoted by the average payoff of all individual neighbors, with the traditional individual payoffs by introducing a selection parameter u. Tuning u equal to zero returns the traditional version, while increasing u bears the influence of environment. We find that considering the environment, i.e., integrating neighborhoods in the evaluation of fitness, promotes cooperation. If we enhance the value of u, the invasion of defection could be resisted better. We also provide quantitative explanations and complete phase diagrams presenting the influence of the environment on the evolution of cooperation. Finally, the universality of this mechanism is testified for different neighborhood sizes, different topology structures and different game models. Our work may shed light on the emergence and persistence of cooperation in our life.     

Impacts of memory on a regular lattice for different population sizes with asynchronous update in spatial snowdrift game

Memory is an important factor on the evolution of cooperation in spatial structure. For evolutionary biologists, the problem is often how cooperation acts can emerge in an evolving system. In the case of snowdrift game, it is found that memory can boost cooperation level for large cost-to-benefit ratio r, while inhibit cooperation for small r. Thus, how to enlarge the range of r for the purpose of enhancing cooperation becomes a hot issue recently. This paper addresses a new memory-based approach and its core lies in: Each agent applies the given rule to compare its own historical payoffs in a certain memory size, and take the obtained maximal one as virtual payoff. In order to get the optimal strategy, each agent randomly selects one of its neighbours to compare their virtual payoffs, which can lead to the optimal strategy. Both constant-size memory and size-varying memory are investigated by means of a scenario of asynchronous updating algorithm on regular lattices with different sizes. Simulation results show that this approach effectively enhances cooperation level in spatial structure and makes the high cooperation level simultaneously emerge for both small and large r. Moreover, it is discovered that population sizes have a significant influence on the effects of cooperation.     

The mechanism of alliance promotes cooperation in the spatial multi-games

In reality, individuals often tend to enhance their competitiveness by forming alliances with the partners sharing the same view. Motivated by this phenomenon, we propose a novel model considering the mechanism of alliance to investigate the evolution of cooperation in the spatial multi-games, in which the intensity of alliance could be adjusted by a parameter μ. In detail, the focal individual will contribute the ratio μ of his own payoff as a cost of the alliance, and then expect to gain the equal portion of average benefits of the neighbors holding the same strategy, which means that the individual fitness can be tuned by the intensity of alliance. Through extensive numerical simulations, one could find that the mechanism of alliance can significantly promote the prosperity of cooperation. Moreover, the larger the value of μ, the stronger the intensity of alliance, which could lead to the higher the level of cooperation. In particular, the evolutionary dynamics presents a complex situation when the co-changes of the intensity of alliance μ and sucker's payoff δ are commonly considered. Furthermore, we also verify the robustness of the proposed mechanism by using the diversity of the intensity of alliance and different network topologies. The current results are conducive to comprehending the emergence and persistence of cooperation within the real-world population.     

Reputation-based strategy persistence promotes cooperation in spatial social dilemma

Understanding the emergence and maintenance of cooperation in social dilemma has received a lot of attention. In previous research, many scholars found that the reputation mechanism can promote cooperation, and the variation of reputation is consistent. However, in reality, according to both one's current action and past experiences, every individual's impression from others is modified to varying extent everyday. In other words, the length of duration of the same performance influences the diverse scale of their own reputation fluctuation. Therefore, a reputation-based strategy persistence mechanism, in which the increment of current reputation is determined by the persistence of last strategy, is proposed. Moreover, we introduce a parameter α to illustrate the impact of strategy persistence on reputation variation. The results of simulation show that the new mechanism paves the way for cooperation in evolutionary game, and the smaller α is, the better the mechanism performs.     

Effect of Aspiration and Mean Gain on the Emergence of Cooperation in Unidirectional Pedestrian Flow

When more than one pedestrian want to move to the same site,conflicts appear and thus the involved pedestrians play a motion game.In order to describe the emergence of cooperation during the conflict resolving process,an evolutionary cellular automation model is established considering the effect of aspiration and mean gain.In each game,pedestrian may be gentle cooperator or aggressive defector.We propose a set of win-stay-lose-shrift WSLS like rules for updating pedestrian's strategy.These rules prescribe that if the mean gain of current strategy between some given steps is larger than aspiration the strategy keeps,otherwise the strategy changes.The simulation results show that a high level aspiration will lead to more cooperation.With the increment of the statistic length,pedestrians will be more rational in decision making.It is also found that when the aspiration level is small enough and the statistic length is large enough all the pedestrian will turn to defectors.We use the prisoner's dilemma model to explain it.At last we discuss the effect of aspiration on fundamental diagram.     

Evolution of cooperation among mobile agents

We study the effects of mobility on the evolution of cooperation among mobile players, which imitate collective motion of biological flocks and interact with neighbors within a prescribed radius R. Adopting the the prisoner’s dilemma game and the snowdrift game as metaphors, we find that cooperation can be maintained and even enhanced for low velocities and small payoff parameters, when compared with the case that all agents do not move. But such enhancement of cooperation is largely determined by the value of R, and for modest values of R, there is an optimal value of velocity to induce the maximum cooperation level. Besides, we find that intermediate values of R or initial population densities are most favorable for cooperation, when the velocity is fixed. Depending on the payoff parameters, the system can reach an absorbing state of cooperation when the snowdrift game is played. Our findings may help understanding the relations between individual mobility and cooperative behavior in social systems.     

零行列式策略在雪堆博弈中的演化

零行列式策略不仅可以单方面设置对手收益,而且可以对双方的收益施加一个线性关系,从而达到敲诈对手的目的.本文针对零行列式策略博弈前期与稳态期的收益存在偏差,基于Markov链理论给出零行列式策略与全合作策略博弈的瞬态分布、瞬态收益及达到稳态所需时间.发现在小的敲诈因子下,敲诈者前期收益高于稳态期收益,敲诈因子较大时,情况截然相反,并且敲诈因子越大,越不利于双方合作,达到稳态也越慢.这为现实生活中频繁更新策略的博弈提供了一种计算实时收益的方法.此外针对敲诈策略与进化人的博弈,论证了双方均背叛状态下,进化人下次博弈时一定进化为全合作策略.通过对所有状态下策略更新过程仿真,发现进化人在四种情况下的进化速度有显著差异,并最终演化为全合作策略,表明零行列式策略是合作产生的催化剂.     

Parrondo?s game using a discrete-time quantum walk

We present a new form of a Parrondo game using discrete-time quantum walk on a line. The two players A and B with different quantum coins operators, individually losing the game can develop a strategy to emerge as joint winners by using their coins alternatively, or in combination for each step of the quantum walk evolution. We also present a strategy for a player A (B) to have a winning probability more than player B (A). Significance of the game strategy in information theory and physical applications are also discussed.     

Cautious strategy update promotes cooperation in spatial prisoner’s dilemma game

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.     

Evolution of cooperation among interacting individuals through molecular dynamics simulations

Using molecular dynamics (MD) simulation and evolutionary game theory, we incorporate the spacial structure of individuals into the study of the behaviors of cooperation, by adopting the prisoner's dilemma and snowdrift game as metaphors of cooperation between unrelated individuals. The results show that the introduction of spacial structure enhances cooperation using the strategy of prisoner's dilemma while does not make much changes to the cooperation if the strategy of snowdrift game is used. It is also found that our model is a meta-phase between regular ring graph model and complex network model. And the “activity of players” T^* we introduced makes our simulation much more closer to real world problems.     

Promoting cooperation by local contribution under stochastic win-stay-lose-shift mechanism

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.     

Promotion of cooperation by aspiration-induced migration

In this paper, we study an aspiration-induced migration model, in which each individual plays the prisoner’s dilemma game with those being within a circle of radius r centered on himself/herself. An individual will migrate to a randomly chosen place with the velocity v if his/her payoff is below the aspiration level. We report that cooperative behavior is favored when the aspiration level and interaction radius are moderate, and the migration velocity is slow.     

Promotion of cooperation induced by the interplay between structure and game dynamics

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.     

Emergent cooperation amongst competing agents in minority games

We study a variation of the minority game. There are N agents. Each has to choose between one of two alternatives every day, and there is a reward to each member of the smaller group. The agents cannot communicate with each other, but try to guess the choice others will make, based only on the past history of the number of people choosing the two alternatives. We describe a simple probabilistic strategy using which the agents, acting independently, and trying to maximize their individual expected payoff, still achieve a very efficient overall utilization of resources, and the average deviation of the number of happy agents per day from the maximum possible can be made O(N^?), for any ?>0. We also show that a single agent does not expect to gain by not following the strategy.     

Promotion of cooperation in aspiration-based spatial prisoner’s dilemma game

We introduce a deterministic aspiration-based learning mechanism into the prisoner’s dilemma game on regular lattices and then investigate the evolution of cooperation for different values of aspiration level A. It is found that the cooperation level exhibits discontinuous phase transition with A and there is a moderate aspiration level that can best favor the cooperative behavior. Besides, the evolution time series show the so-called “ping-pong effect” for both high and low aspiration levels. The evolution of spatial patterns is also investigated. It is found that the cooperator frequency is not sensitive to the initial condition but the evolutionary patterns can be quite different.     

Cooperation in the spatial public goods game with the second-order reputation evaluation

The existence of reputation can significantly promote the level of cooperation within the human population. In the recent years, most of the researches were based on binary image score or first-order evaluation standard. In this paper, we propose a second-order reputation evaluation model, in which the individual's image score will change not only in accordance with his own strategy, but also the reputation value of neighbors. Individuals try to enhance their reputation to cooperate with the surrounding high-reputation individuals, and then becomes an influential individual in the population. The existence of this mechanism renders the individuals who at the edge of the clusters formed by the cooperators to rapidly accumulate their reputation values through the adoption of cooperative strategy, and then the cooperative strategy can be spread widely and rapidly in the whole population. Through extensive numerical simulations, it is clearly indicated that the population cooperation behavior will be obviously improved when the individual's influence factor becomes smaller or the reputation step length increases. The current results are further conducive to understanding the emergence of cooperation in many real world systems.     

Evolutionary fate of memory-one strategies in repeated prisoner’s dilemma game in structured populations

We study evolutionary spatial prisoner’s dilemma game involving a one-step memory mechanism of the individuals whenever making strategy updating. In particular, during the process of strategy updating, each individual keeps in mind all the outcome of the action pairs adopted by himself and each of his neighbors in the last interaction, and according to which the individuals decide what actions they will take in the next round. Computer simulation results imply that win-stay-lose-shift like strategy win out of the memory-one strategy set in the stationary state. This result is robust in a large range of the payoff parameter, and does not depend on the initial state of the system. Furthermore, theoretical analysis with mean field and quasi-static approximation predict the same result. Thus, our studies suggest that win-stay-lose-shift like strategy is a stable dominant strategy in repeated prisoner’s dilemma game in homogeneous structured populations.     

Evolution of ethnocentrism on undirected and directed Barabási-Albert networks

Using Monte Carlo simulations, we study the evolution of contingent cooperation and ethnocentrism in the one-shot game. Interactions and reproduction among computational agents are simulated on undirected and directed Barabási-Albert (BA) networks. We first replicate the Hammond-Axelrod model of in-group favoritism on a square lattice and then generalize this model on undirected and directed BA networks for both asexual and sexual reproduction cases. Our simulations demonstrate that irrespective of the mode of reproduction, the ethnocentric strategy becomes common even though cooperation is individually costly and mechanisms such as reciprocity or conformity are absent. Moreover, our results indicate that the spread of favoritism towards similar others highly depends on the network topology and the associated heterogeneity of the studied population.