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.     

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.     

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.     

The effect of recommended role models in prisoner’s dilemma game

Previous studies concerning the prisoner’s dilemma game on graphs conventionally assume that individuals select role models from their replacement graphs at random. We propose a extended prisoner’s dilemma game model to study the impact of recommended role models on the evolution of cooperation in a homogeneous population. Individuals are endowed with the capacity to recommend the ones they imitated in the past to their neighbors for strategy updating. Numerical simulations show that cooperation can be improved significantly when recommendation is allowed. Our results might be helpful in explaining the widespread cooperation in the real world.     

Individual’s strategy characterized by local topology conditions in prisoner’s dilemma on scale-free networks

We introduce a “gradient” to find out the defectors, and further a “topology potential” to characterize the individual’s strategy preference in the prisoner’s dilemma on scale-free networks. It is shown that the cooperators typically locate on the nodes with high topology potential and the defectors are mainly found on the nodes with small topology potential. A critical topology potential is found for the nodes where cooperators are nip and tuck with defectors. So the information of node’s degree, gradient and topology potential together can predict individual’s strategy decision in the prisoner’s dilemma on the complex networks.     

Adjusting learning motivation to promote cooperation

An evolutionary prisoner’s dilemma game with players adjusting their learning motivation is studied. At each time step, each player can adjust his/her learning motivation according to the difference between the current payoff and payoff aspiration. Greater payoff aspiration means stronger learning motivation, and vice versa. We find that the density of cooperation in a spatial prisoner’s dilemma game is enhanced when the learning motivation mechanism is considered. Meanwhile, we show that proper noise can not only induce the highest cooperation level but also can maintain the cooperation phenomenon even though there is more temptation to defect.     

Coevolutionary,coexisting learning and teaching agents model for prisoner’s dilemma games enhancing cooperation with assortative heterogeneous networks

Unlike other natural network systems, assortativity can be observed in most human social networks, although it has been reported that a social dilemma situation represented by the prisoner’s dilemma favors dissortativity to enhance cooperation. We established a new coevolutionary model for both agents’ strategy and network topology, where teaching and learning agents coexist. Remarkably, this model enables agents’ enhancing cooperation more than a learners-only model on a time-frozen scale-free network and produces an underlying assortative network with a fair degree of power-law distribution. The model may imply how and why assortative networks are adaptive in human society.     

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.     

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.     

Evolutionary game on a stochastic growth network

In some real complex systems the structures are difficult to map or changing over time. To explore the evolution of strategies on these complex systems, it is not realistic enough to specify their structures or topological properties in advance. In this paper, we address the evolutionary game on a stochastic growth network adopting the prisoner’s dilemma game. We introduce a growing rate q$q$ to control the ratio of network growth to strategy evolution. A large q$q$ denotes that the network grows faster than strategy evolution. Simulation results show that a fast growing rate is helpful to promote the average payoffs of both cooperators and defectors. Moreover, this parameter also significantly influences the cooperation frequency on the resulting networks. The coexisting mechanisms in this paper may provide a beneficial insight for understanding the emergence of complex topological structures and game behaviors in numerous real systems.     

Statistical mechanics approach to a reinforcement learning model with memory

We introduce a two-player model of reinforcement learning with memory. Past actions of an iterated game are stored in a memory and used to determine player’s next action. To examine the behaviour of the model some approximate methods are used and confronted against numerical simulations and exact master equation. When the length of memory of players increases to infinity the model undergoes an absorbing-state phase transition. Performance of examined strategies is checked in the prisoner’ dilemma game. It turns out that it is advantageous to have a large memory in symmetric games, but it is better to have a short memory in asymmetric ones.     

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.     

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.     

Evolutionary prisoner’s dilemma game in flocks

We investigate an evolutionary prisoner’s dilemma game among self-driven agents, where collective motion of biological flocks is imitated through averaging directions of neighbors. Depending on the temptation to defect and the velocity at which agents move, we find that cooperation can not only be maintained in such a system but there exists an optimal size of interaction neighborhood, which can induce the maximum cooperation level. When compared with the case that all agents do not move, cooperation can even be enhanced by the mobility of individuals, provided that the velocity and the size of neighborhood are not too large. Besides, we find that the system exhibits aggregation behavior, and cooperators may coexist with defectors at equilibrium.     

Influence of the variance of degree distributions on the evolution of cooperation in complex networks

We study how initial network structure affects the evolution of cooperation in a spatial prisoner’s dilemma game. The network structure is characterized by various statistical properties. Among those properties, we focus on the variance of the degree distribution, and inquire how it affects the evolution of cooperation by three methods of imitation. For every method, it was found that a scale-free network does not always promote the evolution of cooperation, and that there exists an appropriate value of the variance, at which cooperation is optimal.     

The use of a data envelopment analysis efficient rule to produce a steady and high cooperation frequency in a spatial evolvement game

We use the data envelopment analysis (DEA) method to estimate the relative efficiency of the current strategy for each player in a game by taking the spatial distribution of strategies as input and the total payoff as output. Based on the optimal value of the DEA model, we present a DEA efficient rule to update the strategy in evolutionary games. Simulations of the prisoner’s dilemma game (PDG) [4] and the snowdrift game (SG) on two-dimensional regular lattices of four, six, and eight neighbors with periodic boundary conditions, are carried out; the results show the emergence of high and stable cooperator frequency. The heuristic analysis of the DEA efficient rule are discussed in detail. Our work may be helpful in exploring the promotion of cooperator behavior.     

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.     

Efficiency based strategy spreading in the prisoner’s dilemma game

In contrast to well-mixed populations, discrete interaction patterns have been shown to support cooperation in the prisoner’s dilemma game, and a scale-free network topology may even lead to a dominance of cooperation over defection. The majority of studies assumes a strategy adoption scheme based on accumulated payoffs. The use of accumulated payoffs, however, is incompatible with the integral property of the underlying replicator dynamics to be invariant under a positive affine transformation of the payoff function. We show that using instead the payoff per interaction to determine the strategy spread, which has been suggested recently and recovers the required invariance, results in fundamentally different dynamical behavior under a synchronized strategy adoption considered here. Most notably, in such an efficiency based scenario the advantage of a scale-free network topology vanishes almost completely. We present a detailed explanation of the fundamentally altered dynamical behavior.     

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.     

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.