Other-regarding preference and the evolutionary prisoner’s dilemma on complex networks

Prevailing models of the evolutionary prisoner’s game on networks always assume that agents are pursuing their own profit maximization. But the results from experimental games show that many agents have other-regarding preference. In this paper, we study the emergence of cooperation from the prisoner’s dilemma game on complex networks while some agents exhibit other-regarding preference such as inequality aversion, envious and guilty emotions. Contrary to common ideas, the simulation results show that the existence of inequality aversion agents does not promote cooperation emergence on a BA (Barabási and Albert) scale-free network in most situations. If the defection attraction is big and agents exhibit strong preference for inequality aversion, the frequency of cooperators will be lower than in situations where no inequality aversion agents exist. In some cases, the existence of the inequality agents will even induce the frequency of cooperators to zero, a feature which is not observed in previous research on the prisoner’s dilemma game when the underlying interaction topology is a BA scale-free network. This means that if an agent cares about equality too much, it will be difficult for cooperation to emerge and the frequency of cooperators will be low on BA networks. The research on the effect of envy or guilty emotions on the emergence of cooperation in the prisoner’s dilemma game on BA networks obtains similar results, though some differences exist. However, simulation results on a WS (Watts and Strogatz) small-world network display another scenario. If agents care about the inequality of agents very much, the WS network favors cooperation emergence in the prisoners’ dilemma game when other-regarding agents exist. If the agent weight on other-regarding is lowered, the cooperation frequencies emerging on a WS network are not much different from those in situations without other-regarding agents, although the frequency of cooperators is lower than those of the situation without other-regarding preference agents sometimes. All the simulation results imply that inequality aversion and its variations can have important effects on cooperation emergence in the prisoner’s dilemma game, and different network topologies have different effects on cooperation emergence in the prisoner’s dilemma game played on complex networks.     

Evolution of Cooperation in Evolutionary Games for Heterogeneous Interactions

When a population structure is modelled as a square lattice,the cooperation may be improved for an evolutionary prisoner dilemma game or be inhibited for an evolutionary snowdrift game.In this work,we investigate cooperation in a population on a square lattice where the interaction among players contains both prisoner dilemma game and snowdrift game.The heterogeneity in interaction is introduced to the population in two different ways:the heterogenous character of interaction assigned to every player(HCP) or the heterogenous character of interaction assigned to every link between any two players(HCL).The resonant enhancement of cooperation in the case of HCP is observed while the resonant inhibition of cooperation in the case of HCL is prominent.The explanations on the enhancement or inhibition of cooperation are presented for these two cases.     

Coevolution of game and network structure with adjustable linking

Most papers about the evolutionary game on graph assume the statistic network structure. However, in the real world, social interaction could change the relationship among people. And the change of social structure will also affect people’s strategies. We build a coevolution model of prisoner’s dilemma game and network structure to study the dynamic interaction in the real world. Differing from other coevolution models, players rewire their network connections according to the density of cooperation and other players’ payoffs. We use a parameter α to control the effect of payoff in the process of rewiring. Based on the asynchronous update rule and Monte Carlo simulation, we find that, when players prefer to rewire their links to those who are richer, the temptation can increase the cooperation density.     

Evolutionary prisoner’s dilemma game on highly clustered community networks

This paper studies the evolutionary prisoner's dilemma game on a highly clustered community network in which the clustering coefficient and the community size can be tuned. It finds that the clustering coefficient in such a degree-homogeneous network inhibits the emergence of cooperation for the entire range of the payoff parameter. Moreover, it finds that the community size can also have a marked influence on the evolution of cooperation, with a larger community size leading to not only a lower cooperation level but also a smaller threshold of the payoff parameter above which cooperators become extinct.     

Memory-based prisoner’s dilemma on square lattices

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.     

Cooperation and community structure in social networks

Situations of conflict giving rise to social dilemmas are widespread in society. One way of studying these important phenomena is by using simplified models of individual behavior under conflicting situations such as evolutionary game theory. Starting from the observation that individuals interact through networks of acquaintances, we study the evolution of cooperation on model and real social networks through well known paradigmatic games. Using a new payoff scheme which leaves replicator dynamics invariant, we find that cooperation is sustainable in such networks, even in the difficult case of the prisoner’s dilemma. The evolution and stability of cooperation implies the condensation of game strategies into the existing community structures of the social network in which clusters of cooperators survive thanks to their higher connectivity towards other fellow cooperators.     

Role of population density and increasing neighborhood in the evolution of cooperation on diluted lattices

We investigate the evolution of cooperative behaviors with increasing neighborhood size on diluted lattices. For three typical pairwise game models which include prisoner’s dilemma, snowdrift and stag hunt games, all numerical results indicate that cooperation can persist or emerge around the optimal population density which is dictated by the percolation threshold on the square lattice. Meanwhile, the neighborhood size determines the interaction ranges of focal players and then dominates the percolation threshold, and extensive numerical simulations demonstrate that the intermediate neighborhood size is the most beneficial to the evolution of cooperation in the current lattice setup. The current findings can help to deeply understand the sustenance and emergence of collective cooperation in many natural, social and economic systems.     

Effect of community structure on coevolutionary dynamics with dynamical linking

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.     

A novel snowdrift game model with edge weighting mechanism on the square lattice

We propose a novel snowdrift game model with edge weighting mechanism to explore the cooperative behaviors among the players on the square lattice. Based on the assumption of three types of weight distribution including uniform, exponential and power-law schemes, the cooperation level is largely boosted in contrast with the traditional snowdrift game on the unweighted square lattice. Extensive numerical simulations indicate that the fraction of cooperators greatly augments, especially for the intermediate range of cost-to-benefit ratio r. Furthermore, we investigate how the cooperative behaviors are affected by the undulation amplitude of weight distribution and noise strength of strategy selection, respectively. The simulation results will be conducive to further understanding and analyzing the emergence of cooperation, which is a ubiquitous phenomenon in social and biological science.     

Spatial Games Based on Pursuing the Highest Average Payoff

We propose a strategy updating mechanism based on pursuing the highest average payoff to investigate the prisoner＇s dilemma game and the snowdrift game. We apply the new rule to investigate cooperative behaviours on regular, small-world, scale-free networks, and find spatial structure can maintain cooperation for the prisoner＇s dilemma game. fn the snowdrift game, spatial structure can inhibit or promote cooperative behaviour which depends on payoff parameter. We further study cooperative behaviour on scale-free network in detail. Interestingly, non-monotonous behaviours observed on scale-free network with middle-degree individuals have the lowest cooperation level. We also find that large-degree individuals change their strategies more frequently for both games.     

Modelling Moran Process with Network Dynamics for the Evolution of Cooperation

We introduce a simple model based on the Moran process with network dynamics. Using pair approximation, the cooperation frequencies at equilibrium states are deduced for general interactions. Three usual social dilemmas are discussed in the framework of our model. It is found that they all have a phase transition at the same value of cost-to-benefit ratio. For the prisoner＇s dilemma game, notably it is exactly the simple rule reported in the literature [Nature 441 （2006） 502]. In our model, the simple rule results from the parent-offspring link. Thus the basic mechanism for cooperation enhancement in network reciprocity is in line with the Hamilton rule of kin selection. Our simulations verify the analysis obtained from pair approximation.     

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.     

Evolutionary Games in Two-Layer Networks with the Introduction of Dominant Strategy

We study evolutionary games in two-layer networks by introducing the correlation between two layers through the C-dominance or the D-dominance. We assume that individuals play prisoner's dilemma game(PDG) in one layer and snowdrift game(SDG) in the other. We explore the dependences of the fraction of the strategy cooperation in different layers on the game parameter and initial conditions. The results on two-layer square lattices show that, when cooperation is the dominant strategy; initial conditions strongly influence cooperation in the PDG layer while have no impact in the SDG layer. Moreover,in contrast to the result for PDG in single-layer square lattices, the parameter regime where cooperation could be maintained expands significantly in the PDG layer. We also investigate the effects of mutation and network topology. We find that different mutation rates do not change the cooperation behaviors. Moreover,similar behaviors on cooperation could be found in two-layer random networks.     

Elimination mechanism promotes cooperation in coevolutionary prisoner’s dilemma games

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.     

Evolutionary Prisoner's Dilemma Game Based on Pursuing Higher Average Payoff

We investigate the prisoner＇s dilemma game based on a new rule： players will change their current strategies to opposite strategies with some probability if their neighbours＇ average payoffs are higher than theirs. Compared with the cases on regular lattices （RL） and Newman-Watts small world network （NW）, cooperation can be best enhanced on the scale-free Barabasi-Albert network （BA）. It is found that cooperators are dispersive on RL network, which is different from previously reported results that cooperators will form large clusters to resist the invasion of defectors. Cooperative behaviours on the BA network are discussed in detail. It is found that large-degree individuals have lower cooperation level and gain higher average payoffs than that of small-degree individuals. In addition, we find that small-degree individuals more frequently change strategies than do large- degree individuals.     

Effects of aspiration on public cooperation in structured populations

We introduce a deterministic win-stay-lose-shift rule into the spatial public goods game, according to which a player will change its current strategy only if its payoff is below a predefined aspiration level. Simulation results on the square lattice and scale-free network indicate that the aspiration level greatly affects the evolution of cooperation. For small multiplication factors, the frequency of cooperation increases to 0.5 as the aspiration level increases. For large multiplication factors, intermediate levels of aspiration prove optimal for the successful evolution of public cooperation. Some qualitative analyses are provided to explain the above results. Besides, we have found that there exists a ping-pong vibration of cooperation at some specific values of multiplication factors and aspiration levels.     

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.     

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.     

Effects of Topological Randomness on Cooperation in a Deterministic Prisoner's Dilemma Game

In this work, we consider an evolutionary prisoner's dilemma game on a homogeneous random network with the richest-following strategy adoption rule. By constructing homogeneous random networks from a regular ring graph, we investigate the effects of topological randomness on cooperation. In contrast to the ordinary view that the presence of small amount of shortcuts in ring graphs favors cooperation, we find the cooperation inhibition by weak
topological randomness. The explanations on the observations are presented.     

Does “game participation cost” affect the advantage of heterogeneous networks for evolving cooperation?

Masuda [N. Masuda, Participation costs dismiss the advantage of heterogeneous networks in evolution of cooperation, Proceedings of the Royal Society B 274 (2007) 1815-1821] reported that a game participation cost (expressed by adding same negative values to all four elements in a 2 × 2 payoff matrix) affects the advantage of heterogeneous networks in the evolution of cooperation. We show that this finding is not always true depending on the features of the network, indicating that participation costs help cooperation in certain situations rather than destroy it. In a weaker dilemma game on a scale free network derived from the Barabasi & Albert algorithm with a larger average degree, game participation cost helps rather than destroy the network reciprocity.