Diversity-optimized cooperation on complex networks

First-passage distributions of an asymmetric noisy voter model

This paper explores the first-passage times in an asymmetric noisy voter model through analytical methods. The noise in the model leads to bistable behavior, and the asymmetry arises from heterogeneous rates for spontaneous switching. We obtain exact analytical expressions for the probability distribution for two different initial conditions, first-passage times for switching transitions and first return times to a stable state for all system sizes, offering a deeper understanding of the model's dynamics. Additionally, we derive exact expressions for the mean switching time, mean return time, and their mean square variants. The findings are verified through numerical simulations. To enhance clarity regarding the model's behavior, we also provide approximate solutions, emphasizing the parameter dependence of first-passage times in the small switching parameter regime. An interesting result in this regime is that while the mean switching time in the leading order is independent of system size, the mean return time depends inversely on system size. This study not only advances our analytical understanding of the asymmetric noisy voter model but also establishes a framework for exploring similar phenomena in social and biological systems where the noisy voter model is applicable.

A social system to disperse the irrigation start date based on the spatial public goods game

In paddy rice cultivation, the amount of water used during the beginning of the irrigation season is the highest. However, there is a possibility of a water shortage at this season as climate change decreases snowfall. In this study, we propose new schemes based on the public goods game to reduce peak water volume during this season by dispersing the irrigation start dates. In our agent-based model, agents determine the irrigation start date based on the evolutionary game theory. This model considers the economic variables of individual farmers (e.g., gross cultivation profit and cultivation cost), the cost and subsidy for cooperation for the dispersion of the irrigation start dates, and the information-sharing network between farmers. Individual farmers update the cooperation/defection strategy at each time step based on their payoffs. Using this agent-based model simulation, we investigate a scheme that maximizes the dispersion of irrigation start dates among multiple scheme candidates. The results of the simulation show that, under the schemes in which one farmer belongs to a group and the groups do not overlap, the number of cooperating farmers did not increase, and the dispersion of irrigation start dates barely increased. By adopting a scheme in which one farmer belongs to multiple groups and the groups overlap, the number of cooperating farmers increased, while the dispersion of irrigation start dates maximized. Furthermore, the proposed schemes require the government to obtain information about the number of cooperators in each group to determine the subsidy amount. Therefore, we also proposed the method which allows estimating the number of cooperators in each group through the dispersion of irrigation start dates. This significantly reduces the cost of running the schemes and provides subsidization and policy evaluations unaffected by false declarations of farmers.

Towards preferential selection in the prisoner's dilemma game

In previous works, the choice of learning neighbor for an individual has generally obeyed pure random selection or preferential selection rules. In this paper, we introduce a tunable parameter ε to characterize the strength of preferential selection and focus on the transition towards preferential selection in the spatial evolutionary game by controlling ε to guide the system from pure random selection to preferential selection. Our simulation results reveal that the introduction of preferential selection can hugely alleviate social dilemmas and enhance network reciprocity. A larger ε leads to a higher critical threshold of the temptation b for the extinction of cooperators. Moreover, we provide some intuitive explanations for the above results from the perspective of strategy transition and cooperative clusters. Finally, we examine the robustness of the results for noise K and different topologies, find that qualitative features of the results are unchanged.

Evolutionary public goods game on the birandom geometric graph

To investigate the evolution of cooperation in spatial public goods games, this paper establishes a birandom geometric graph, in which two types of nodes, representing players and public goods respectively, are placed at random locations in the unit square. Each public good has a limit influence range and the individuals that fall into the same range engage in a public good game. In contrast to the classical network models consisting of only one type of nodes, the birandom geometric graph provides a natural way to describe the scenarios where individuals and public resources are independent of each other. Numerical simulations reveal that cooperation can be significantly promoted when the group size and the average number of groups that each player participates in are relatively small, which is at odds with the results on the square lattice, but is consistent with a body of empirical evidence reported by Ostrom and Olson et al. Analysis of the evolutionary process suggests that the facilitation of cooperation is due primarily to the formation of the cooperative clusters, which can effectively resist the invasion of the defectors.

Cooperation in a generalized age-structured spatial game

The emergence and prevalence of cooperative behavior within a group of selfish individuals remains a puzzle for evolutionary game theory precisely because it conflicts directly with the central idea of natural selection. Accordingly, in recent years, the search for an understanding of how cooperation can be stimulated, even when it conflicts with individual interest, has intensified. We investigate the emergence of cooperation in an age-structured evolutionary spatial game. In it, players age with time and the payoff that they receive after each round depends on their age. We find that the outcome of the game is strongly influenced by the type of distribution used to modify the payoffs according to the age of each player. The results show that, under certain circumstances, cooperators may not only survive but dominate the population.

Heterogeneous cooperative leadership structure emerging from random regular graphs

This paper investigates the evolution of cooperation and the emergence of hierarchical leadership structure in random regular graphs. It is found that there exist different learning patterns between cooperators and defectors, and cooperators are able to attract more followers and hence more likely to become leaders. Hence, the heterogeneous distributions of reputation and leadership can emerge from homogeneous random graphs. The important directed game-learning skeleton is then studied, revealing some important structural properties, such as the heavy-tailed degree distribution and the positive in-in degree correlation.

Evolutionary prisoner's dilemma games coevolving on adaptive networks

We study a model for switching strategies in the Prisoner's Dilemma game on adaptive networks of player pairings that coevolve as players attempt to maximize their return. We use a node-based strategy model wherein each player follows one strategy at a time (cooperate or defect) across all of its neighbors, changing that strategy and possibly changing partners in response to local changes in the network of player pairing and in the strategies used by connected partners. We compare and contrast numerical simulations with existing pair approximation differential equations for describing this system, as well as more accurate equations developed here using the framework of approximate master equations. We explore the parameter space of the model, demonstrating the relatively high accuracy of the approximate master equations for describing the system observations made from simulations. We study two variations of this partner-switching model to investigate the system evolution, predict stationary states, and compare the total utilities and other qualitative differences between these two model variants.

Extortion provides alternative routes to the evolution of cooperation in structured populations

In this paper, we study the evolution of cooperation in structured populations (individuals are located on either a regular lattice or a scale-free network) in the context of repeated games by involving three types of strategies, namely, unconditional cooperation, unconditional defection, and extortion. The strategy updating of the players is ruled by the replicator-like dynamics. We find that extortion strategies can act as catalysts to promote the emergence of cooperation in structured populations via different mechanisms. Specifically, on regular lattice, extortioners behave as both a shield, which can enwrap cooperators inside and keep them away from defectors, and a spear, which can defeat those surrounding defectors with the help of the neighboring cooperators. Particularly, the enhancement of cooperation displays a resonance-like behavior, suggesting the existence of optimal extortion strength mostly favoring the evolution of cooperation, which is in good agreement with the predictions from the generalized mean-field approximation theory. On scale-free network, the hubs, who are likely occupied by extortioners or defectors at the very beginning, are then prone to be conquered by cooperators on small-degree nodes as time elapses, thus establishing a bottom-up mechanism for the emergence and maintenance of cooperation.

Reciprocity in spatial evolutionary public goods game on double-layered network

Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time.

Evolutionary dynamics of synergistic and discounted group interactions in structured populations

The emergence of cooperation between unrelated individuals enables researchers to study how the collective cooperative behavior survives in a world where egoists could get more short-term benefits. The spatial multi-player games, which invoke interactions between individuals who are not directly linked by the interactive networks, are drawing more and more attention in exploring the evolution of cooperation. Here we address the evolutionary dynamics in infinite structured populations with discounted, linear, and synergistic group interactions. The five classical scenarios are recovered from the dynamics: (i) dominating defection, (ii) dominating cooperation, (iii) co-existence, (iv) bi-stability, and (v) neutral variants. For linear interactions, the evolutionary dynamics is equivalent to that in finite as well as the well-mixed counterparts, which can be achieved by a payoff matrix transformation, and it illustrates that the more neighbors there are, the harder the cooperators survive. Yet both cooperation and defection emerge easier in finite populations than in infinite for discounted and synergistic interactions. Counterintuitively, we find that the synergistic group interactions always raise cooperators׳ barriers to occupy the population with the increase of the number of neighbors in infinite structured populations. Our results go against the common belief that synergistic interactions are necessarily beneficial for the cooperative behavior.

Spatial evolutionary public goods game on complete graph and dense complex networks

We study the spatial evolutionary public goods game (SEPGG) with voluntary or optional participation on a complete graph (CG) and on dense networks. Based on analyses of the SEPGG rate equation on finite CG, we find that SEPGG has two stable states depending on the value of multiplication factor r, illustrating how the "tragedy of the commons" and "an anomalous state without any active participants" occurs in real-life situations. When r is low (<<), the state with only loners is stable, and the state with only defectors is stable when r is high (>>). We also derive the exact scaling relation for r*. All of the results are confirmed by numerical simulation. Furthermore, we find that a cooperator-dominant state emerges when the number of participants or the mean degree, 〈k〉, decreases. We also investigate the scaling dependence of the emergence of cooperation on r and 〈k〉. These results show how "tragedy of the commons" disappears when cooperation between egoistic individuals without any additional socioeconomic punishment increases.

Dependency links can hinder the evolution of cooperation in the prisoner's dilemma game on lattices and networks

Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner's dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whose value is between the payoff of mutual cooperation and the value of temptation to defect. Thus, this mechanism reflects that the dependency relation is stronger than the relation of ordinary mutual cooperation, but it is not large enough to cause the defection of the dependency pair. We show that the dependence of individuals hinders, promotes and never affects the cooperation on regular ring networks, square lattice, random and scale-free networks, respectively. The results for the square lattice and regular ring networks are demonstrated by the pair approximation.

Boosting cooperation by involving extortion in spatial prisoner's dilemma games

We study the evolution of cooperation in spatial prisoner's dilemma games with and without extortion by adopting the 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 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 other case, where cooperation is promoted for an 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.

Stochastic heterogeneous interaction promotes cooperation in spatial prisoner's dilemma game

Previous studies mostly investigate player's cooperative behavior as affected by game time-scale or individual diversity. In this paper, by involving both time-scale and diversity simultaneously, we explore the effect of stochastic heterogeneous interaction. In our model, the occurrence of game interaction between each pair of linked player obeys a random probability, which is further described by certain distributions. Simulations on a 4-neighbor square lattice show that the cooperation level is remarkably promoted when stochastic heterogeneous interaction is considered. The results are then explained by investigating the mean payoffs, the mean boundary payoffs and the transition probabilities between cooperators and defectors. We also show some typical snapshots and evolution time series of the system. Finally, the 8-neighbor square lattice and BA scale-free network results indicate that the stochastic heterogeneous interaction can be robust against different network topologies. Our work may sharpen the understanding of the joint effect of game time-scale and individual diversity on spatial games.

Role of investment heterogeneity in the cooperation on spatial public goods game

Public cooperation plays a significant role in the survival and maintenance of biological species, to elucidate its origin thus becomes an interesting question from various disciplines. Through long-term development, the public goods game has proven to be a useful tool, where cooperator making contribution can beat again the free-rides. Differentiating from the traditional homogeneous investment, individual trend of making contribution is more likely affected by the investment level of his neighborhood. Based on this fact, we here investigate the impact of heterogeneous investment on public cooperation, where the investment sum is mapped to the proportion of cooperators determined by parameter α. Interestingly, we find, irrespective of interaction networks, that the increment of α (increment of heterogeneous investment) is beneficial for promoting cooperation and even guarantees the complete cooperation dominance under weak replication factor. While this promotion effect can be attributed to the formation of more robust cooperator clusters and shortening END period. Moreover, we find that this simple mechanism can change the potential interaction network, which results in the change of phase diagrams. We hope that our work may shed light on the understanding of the cooperative behavior in other social dilemmas.

Social dilemma alleviated by sharing the gains with immediate neighbors

We study the evolution of cooperation in the evolutionary spatial prisoner's dilemma game (PDG) and snowdrift game (SG), within which a fraction α of the payoffs of each player gained from direct game interactions is shared equally by the immediate neighbors. The magnitude of the parameter α therefore characterizes the degree of the relatedness among the neighboring players. By means of extensive Monte Carlo simulations as well as an extended mean-field approximation method, we trace the frequency of cooperation in the stationary state. We find that plugging into relatedness can significantly promote the evolution of cooperation in the context of both studied games. Unexpectedly, cooperation can be more readily established in the spatial PDG than that in the spatial SG, given that the degree of relatedness and the cost-to-benefit ratio of mutual cooperation are properly formulated. The relevance of our model with the stakeholder theory is also briefly discussed.

Random walks in weighted networks with a perfect trap: an application of Laplacian spectra

Trapping processes constitute a primary problem of random walks, which characterize various other dynamical processes taking place on networks. Most previous works focused on the case of binary networks, while there is much less related research about weighted networks. In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory, we provide an exact formula for mean first-passage time (MFPT) from one node to another, based on which we deduce an explicit expression for average trapping time (ATT) in terms of the eigenvalues and eigenvectors of the Laplacian matrix associated with the weighted graph, where ATT is the average of MFPTs to the trap over all source nodes. We then further derive a sharp lower bound for the ATT in terms of only the local information of the trap node, which can be obtained in some graphs. Moreover, we deduce the ATT when the trap is distributed uniformly in the whole network. Our results show that network weights play a significant role in the trapping process. To apply our framework, we use the obtained formulas to study random walks on two specific networks: trapping in weighted uncorrelated networks with a deep trap, the weights of which are characterized by a parameter, and Lévy random walks in a connected binary network with a trap distributed uniformly, which can be looked on as random walks on a weighted network. For weighted uncorrelated networks we show that the ATT to any target node depends on the weight parameter, that is, the ATT to any node can change drastically by modifying the parameter, a phenomenon that is in contrast to that for trapping in binary networks. For Lévy random walks in any connected network, by using their equivalence to random walks on a weighted complete network, we obtain the optimal exponent characterizing Lévy random walks, which have the minimal average of ATTs taken over all target nodes.

Evolutionary dynamics of group interactions on structured populations: a review

Interactions among living organisms, from bacteria colonies to human societies, are inherently more complex than interactions among particles and non-living matter. Group interactions are a particularly important and widespread class, representative of which is the public goods game. In addition, methods of statistical physics have proved valuable for studying pattern formation, equilibrium selection and self-organization in evolutionary games. Here, we review recent advances in the study of evolutionary dynamics of group interactions on top of structured populations, including lattices, complex networks and coevolutionary models. We also compare these results with those obtained on well-mixed populations. The review particularly highlights that the study of the dynamics of group interactions, like several other important equilibrium and non-equilibrium dynamical processes in biological, economical and social sciences, benefits from the synergy between statistical physics, network science and evolutionary game theory.

Optimizing cooperation on complex networks in the presence of failure

Cooperation has been recognized as a fundamental driving force in many natural, social, and economic systems. We investigate whether, given a complex-networked system in which agents (nodes) interact with one another according to the rules of evolutionary games and are subject to failure or death, cooperation can prevail and be optimized. We articulate a control scheme to maximize cooperation by introducing a time tolerance, a time duration that sustains an agent even if its payoff falls below a threshold. Strikingly, we find that a significant cooperation cluster can emerge when the time tolerance is approximately uniformly distributed over the network. A heuristic theory is derived to understand the optimization mechanism, which emphasizes the role played by medium-degree nodes. Implications for policy making to prevent or mitigate large-scale cascading breakdown are pointed out.

Bipartite graphs as models of population structures in evolutionary multiplayer games

By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner’s dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner’s dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures.

Risk-driven migration and the collective-risk social dilemma

A collective-risk social dilemma implies that personal endowments will be lost if contributions to the common pool within a group are too small. Failure to reach the collective target thus has dire consequences for all group members, independently of their strategies. Wanting to move away from unfavorable locations is therefore anything but surprising. Inspired by these observations, we here propose and study a collective-risk social dilemma where players are allowed to move if the collective failure becomes too probable. More precisely, this so-called risk-driven migration is launched depending on the difference between the actual contributions and the declared target. Mobility therefore becomes an inherent property that is utilized in an entirely self-organizing manner. We show that under these assumptions cooperation is promoted much more effectively than under the action of manually determined migration rates. For the latter, we in fact identify parameter regions where the evolution of cooperation is greatly inhibited. Moreover, we find unexpected spatial patterns where cooperators that do not form compact clusters outperform those that do, and where defectors are able to utilize strikingly different ways of invasion. The presented results support the recently revealed importance of percolation for the successful evolution of public cooperation, while at the same time revealing surprisingly simple methods of self-organization towards socially desirable states.

Impact of generalized benefit functions on the evolution of cooperation in spatial public goods games with continuous strategies

Cooperation and defection may be considered to be two extreme responses to a social dilemma. Yet the reality is much less clear-cut. Between the two extremes lies an interval of ambivalent choices, which may be captured theoretically by means of continuous strategies defining the extent of the contributions of each individual player to the common pool. If strategies are chosen from the unit interval, where 0 corresponds to pure defection and 1 corresponds to the maximal contribution, the question is what is the characteristic level of individual investments to the common pool that emerges if the evolution is guided by different benefit functions. Here we consider the steepness and the threshold as two parameters defining an array of generalized benefit functions, and we show that in a structured population there exist intermediate values of both at which the collective contributions are maximal. However, as the cost-to-benefit ratio of cooperation increases, the characteristic threshold decreases while the corresponding steepness increases. Our observations remain valid if more complex sigmoid functions are used, thus reenforcing the importance of carefully adjusted benefits for high levels of public cooperation.

Adaptive and bounded investment returns promote cooperation in spatial public goods games

The public goods game is one of the most famous models for studying the evolution of cooperation in sizable groups. The multiplication factor in this game can characterize the investment return from the public good, which may be variable depending on the interactive environment in realistic situations. Instead of using the same universal value, here we consider that the multiplication factor in each group is updated based on the differences between the local and global interactive environments in the spatial public goods game, but meanwhile limited to within a certain range. We find that the adaptive and bounded investment returns can significantly promote cooperation. In particular, full cooperation can be achieved for high feedback strength when appropriate limitation is set for the investment return. Also, we show that the fraction of cooperators in the whole population can become larger if the lower and upper limits of the multiplication factor are increased. Furthermore, in comparison to the traditionally spatial public goods game where the multiplication factor in each group is identical and fixed, we find that cooperation can be better promoted if the multiplication factor is constrained to adjust between one and the group size in our model. Our results highlight the importance of the locally adaptive and bounded investment returns for the emergence and dominance of cooperative behavior in structured populations.

Conditional strategies and the evolution of cooperation in spatial public goods games

The fact that individuals will most likely behave differently in different situations begets the introduction of conditional strategies. Inspired by this, we study the evolution of cooperation in the spatial public goods game, where, besides unconditional cooperators and defectors, also different types of conditional cooperators compete for space. Conditional cooperators will contribute to the public good only if other players within the group are likely to cooperate as well but will withhold their contribution otherwise. Depending on the number of other cooperators that are required to elicit cooperation of a conditional cooperator, the latter can be classified in as many types as there are players within each group. We find that the most cautious cooperators, who require all other players within a group to be conditional cooperators, are the undisputed victors of the evolutionary process, even at very low synergy factors. We show that the remarkable promotion of cooperation is due primarily to the spontaneous emergence of quarantining of defectors, who become surrounded by conditional cooperators and are forced into isolated convex "bubbles" from which they are unable to exploit the public good. This phenomenon can be observed only in structured populations, thus adding to the relevance of pattern formation for the successful evolution of cooperation.

Group-size effects on the evolution of cooperation in the spatial public goods game

We study the evolution of cooperation in public goods games on the square lattice, focusing on the effects that are brought about by different sizes of groups where individuals collect their payoffs and search for potential strategy donors. We find that increasing the group size does not necessarily lead to mean-field behavior, as is traditionally observed for games governed by pairwise interactions, but rather that public cooperation may be additionally promoted by means of enhanced spatial reciprocity that sets in for very large groups. Our results highlight that the promotion of cooperation due to spatial interactions is not rooted solely in having restricted connections among players, but also in individuals having the opportunity to collect payoffs separately from their direct opponents. Moreover, in large groups the presence of a small number of defectors is bearable, which makes the mixed-phase region expand with increasing group size. Having a chance of exploiting distant players, however, offers defectors a different way to break the phalanx of cooperators and even to resurrect from small numbers to eventually completely invade the population.

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks

We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.

How wealth accumulation can promote cooperation

Explaining the emergence and stability of cooperation has been a central challenge in biology, economics and sociology. Unfortunately, the mechanisms known to promote it either require elaborate strategies or hold only under restrictive conditions. Here, we report the emergence, survival, and frequent domination of cooperation in a world characterized by selfishness and a strong temptation to defect, when individuals can accumulate wealth. In particular, we study games with local adaptation such as the prisoner's dilemma, to which we add heterogeneity in payoffs. In our model, agents accumulate wealth and invest some of it in their interactions. The larger the investment, the more can potentially be gained or lost, so that present gains affect future payoffs. We find that cooperation survives for a far wider range of parameters than without wealth accumulation and, even more strikingly, that it often dominates defection. This is in stark contrast to the traditional evolutionary prisoner's dilemma in particular, in which cooperation rarely survives and almost never thrives. With the inequality we introduce, on the contrary, cooperators do better than defectors, even without any strategic behavior or exogenously imposed strategies. These results have important consequences for our understanding of the type of social and economic arrangements that are optimal and efficient.

Feedback reciprocity mechanism promotes the cooperation of highly clustered scale-free networks

We study how the clustering coefficient influences the evolution of cooperation in scale-free public goods games. In games played by groups of individuals, triangle loops provide stronger support for mutual cooperation to resist invasion of selfish behavior than that in the absence of such loops, so that diffusion of cooperative behavior is relatively promoted. The feedback reciprocity mechanism of triangle plays a key role in facilitating cooperation in high clustered networks.

Role of aspiration-induced migration in cooperation

Both cooperation and migration are ubiquitous in human society and animal world. In this Rapid Communication, we propose an aspiration-induced migration in which individuals will migrate to new sites provided that their payoffs are below some aspiration level. It is found that moderate aspiration level can best favor cooperative behavior. In particular, moderate aspiration level enables cooperator clusters to maintain and expand whereas induces defector clusters to disintegrate, thus promoting the diffusion of cooperation among population. Our results provide insights into understanding the role played by migration in the emergence of cooperative behavior.

Impact of critical mass on the evolution of cooperation in spatial public goods games

We study the evolution of cooperation under the assumption that the collective benefits of group membership can only be harvested if the fraction of cooperators within the group, i.e., their critical mass, exceeds a threshold value. Considering structured populations, we show that a moderate fraction of cooperators can prevail even at very low multiplication factors if the critical mass is minimal. For larger multiplication factors, however, the level of cooperation is highest at an intermediate value of the critical mass. The latter is robust to variations of the group size and the interaction network topology. Applying the optimal critical mass threshold, we show that the fraction of cooperators in public goods games is significantly larger than in the traditional linear model, where the produced public good is proportional to the fraction of cooperators within the group.

Selection of noise level in strategy adoption for spatial social dilemmas

We studied spatial Prisoner's Dilemma and Stag Hunt games where both the strategy distribution and the players' individual noise level could evolve to reach higher individual payoff. Players are located on the sites of different two-dimensional lattices and gain their payoff from games with their neighbors by choosing unconditional cooperation or defection. The way of strategy adoption can be characterized by a single K (temperaturelike) parameter describing how strongly adoptions depend on the payoff difference. If we start the system from a random strategy distribution with many different player specific K parameters, the simultaneous evolution of strategies and K parameters drives the system to a final stationary state where only one K value remains. In the coexistence phase of cooperator and defector strategies the surviving K parameter is in good agreement with the noise level that ensures the highest cooperation level if uniform K is supposed for all players. In this paper we give a thorough overview about the properties of this evolutionary process.

Phase diagrams for three-strategy evolutionary prisoner's dilemma games on regular graphs

Evolutionary prisoner's dilemma games are studied with players located on square lattice and random regular graph defining four neighbors for each one. The players follow one of the three strategies: tit-for-tat, unconditional cooperation, and defection. The simplified payoff matrix is characterized by two parameters: the temptation b to choose defection and the cost c of inspection reducing the income of tit-for-tat. The strategy imitation from one of the neighbors is controlled by pairwise comparison at a fixed level of noise. Using Monte Carlo simulations and the extended versions of pair approximation we have evaluated the b-c phase diagrams indicating a rich plethora of phase transitions between stationary coexistence, absorbing, and oscillatory states, including continuous and discontinuous phase transitions. By reasonable costs the tit-for-tat strategy prevents extinction of cooperators across the whole span of b determining the prisoner's dilemma game, irrespective of the connectivity structure. We also demonstrate that the system can exhibit a repetitive succession of oscillatory and stationary states upon changing a single payoff value, which highlights the remarkable sensitivity of cyclical interactions on the parameters that define the strength of dominance.

Topology-independent impact of noise on cooperation in spatial public goods games

We study the evolution of cooperation in public goods games on different regular graphs as a function of the noise level underlying strategy adoptions. We focus on the effects that are brought about by different group sizes of public goods games in which individuals participate, revealing that larger groups of players may induce qualitatively different behavior when approaching the deterministic limit of strategy adoption. While by pairwise interactions an intermediate uncertainty by strategy adoptions may ensure optimal conditions for the survival of cooperators at a specific graph topology, larger groups warrant this only in the vicinity of the deterministic limit independently from the underlying graph. These discrepancies are attributed to the indirect linkage of otherwise not directly connected players, which is brought about by joint memberships within the larger groups. Thus, we show that increasing the group size may introduce an effective transition of the interaction topology, and that the latter shapes the noise dependence of the evolution of cooperation in case of pairwise interactions only.

Coevolutionary games--a mini review

Prevalence of cooperation within groups of selfish individuals is puzzling in that it contradicts with the basic premise of natural selection. Favoring players with higher fitness, the latter is key for understanding the challenges faced by cooperators when competing with defectors. Evolutionary game theory provides a competent theoretical framework for addressing the subtleties of cooperation in such situations, which are known as social dilemmas. Recent advances point towards the fact that the evolution of strategies alone may be insufficient to fully exploit the benefits offered by cooperative behavior. Indeed, while spatial structure and heterogeneity, for example, have been recognized as potent promoters of cooperation, coevolutionary rules can extend the potentials of such entities further, and even more importantly, lead to the understanding of their emergence. The introduction of coevolutionary rules to evolutionary games implies, that besides the evolution of strategies, another property may simultaneously be subject to evolution as well. Coevolutionary rules may affect the interaction network, the reproduction capability of players, their reputation, mobility or age. Here we review recent works on evolutionary games incorporating coevolutionary rules, as well as give a didactic description of potential pitfalls and misconceptions associated with the subject. In addition, we briefly outline directions for future research that we feel are promising, thereby particularly focusing on dynamical effects of coevolutionary rules on the evolution of cooperation, which are still widely open to research and thus hold promise of exciting new discoveries.

Effects of social diversity on the emergence of global consensus in opinion dynamics

We propose a variant of the voter model by introducing the social diversity in the evolution process. Each individual is assigned a weight that is proportional to the power of its degree, where the power exponent alpha is an adjustable parameter that controls the level of diversity among individuals in the network. At each time step, a pair of connected individuals, say i and j , are randomly selected to update their opinions. The probability p(i) of choosing is opinion as their common opinion is proportional to i s weight. We consider the scale-free topology and concentrate on the efficiency of reaching the final consensus, which is significant in characterizing the self-organized systems. Interestingly, it is found that there exists an optimal value of alpha, leading to the shortest consensus time. This phenomenon indicates that, although a strong influence of high-degree individuals is helpful for quick consensus achievement, over strong influence inhibits the convergence process. Other quantities, such as the probability of an individual's initial opinion becomes the final opinion as a function of degree, the evolution of the number of opinion clusters, as well as the relationship between average consensus time and the network size, are also studied. Our results are helpful for better understanding the role of degree heterogeneity of the individuals in the opinion dynamics.