Breaking the symmetry between interaction and replacement in evolutionary dynamics on graphs

Evolutionary dynamics of any multiplayer game on regular graphs

Multiplayer games on graphs are at the heart of theoretical descriptions of key evolutionary processes that govern vital social and natural systems. However, a comprehensive theoretical framework for solving multiplayer games with an arbitrary number of strategies on graphs is still missing. Here, we solve this by drawing an analogy with the Balls-and-Boxes problem, based on which we show that the local configuration of multiplayer games on graphs is equivalent to distributing k identical co-players among n distinct strategies. We use this to derive the replicator equation for any n-strategy multiplayer game under weak selection, which can be solved in polynomial time. As an example, we revisit the second-order free-riding problem, where costly punishment cannot truly resolve social dilemmas in a well-mixed population. Yet, in structured populations, we derive an accurate threshold for the punishment strength, beyond which punishment can either lead to the extinction of defection or transform the system into a rock-paper-scissors-like cycle. The analytical solution also qualitatively agrees with the phase diagrams that were previously obtained for non-marginal selection strengths. Our framework thus allows an exploration of any multi-strategy multiplayer game on regular graphs.

Deterministic theory of evolutionary games on temporal networks

Recent empirical studies have revealed that social interactions among agents in realistic networks merely exist intermittently and occur in a particular sequential order. However, it remains unexplored how to theoretically describe evolutionary dynamics of multiple strategies on temporal networks. Herein, we develop a deterministic theory for studying evolutionary dynamics of any [Formula: see text] pairwise games in structured populations where individuals are connected and organized by temporally activated edges. In the limit of weak selection, we derive replicator-like equations with a transformed payoff matrix characterizing how the mean frequency of each strategy varies over time, and then obtain critical conditions for any strategy to be evolutionarily stable on temporal networks. Interestingly, the re-scaled payoff matrix is a linear combination of the original payoff matrix with an additional one describing local competitions between any pair of different strategies, whose weights are solely determined by network topology and selection intensity. As a particular example, we apply the deterministic theory to analysing the impacts of temporal networks in the mini-ultimatum game, and find that temporally networked population structures result in the emergence of fairness. Our work offers theoretical insights into the subtle effects of network temporality on evolutionary game dynamics.

Competition for resources can reshape the evolutionary properties of spatial structure

Many evolving ecosystems have spatial structures that can be conceptualized as networks, with nodes representing individuals or homogeneous subpopulations and links the patterns of interaction and replacement between them. Prior models of evolution on networks do not take ecological niche differences and eco-evolutionary interplay into account. Here, we combine a resource competition model with evolutionary graph theory to study how heterogeneous topological structure shapes evolutionary dynamics under global frequency-dependent ecological interactions. We find that the addition of ecological competition for resources can produce a reversal of roles between amplifier and suppressor networks for deleterious mutants entering the population. Moreover, we show that this effect is a non-linear function of ecological niche overlap and discuss intuition for the observed dynamics using simulations and analytical approximations.

Imitation dynamics on networks with incomplete information

Imitation is an important learning heuristic in animal and human societies. Previous explorations report that the fate of individuals with cooperative strategies is sensitive to the protocol of imitation, leading to a conundrum about how different styles of imitation quantitatively impact the evolution of cooperation. Here, we take a different perspective on the personal and external social information required by imitation. We develop a general model of imitation dynamics with incomplete information in networked systems, which unifies classical update rules including the death-birth and pairwise-comparison rule on complex networks. Under pairwise interactions, we find that collective cooperation is most promoted if individuals neglect personal information. If personal information is considered, cooperators evolve more readily with more external information. Intriguingly, when interactions take place in groups on networks with low degrees of clustering, using more personal and less external information better facilitates cooperation. Our unifying perspective uncovers intuition by examining the rate and range of competition induced by different information situations.

Time delays shape the eco-evolutionary dynamics of cooperation

We study the intricate interplay between ecological and evolutionary processes through the lens of the prisoner's dilemma game. But while previous studies on cooperation amongst selfish individuals often assume instantaneous interactions, we take into consideration delays to investigate how these might affect the causes underlying prosocial behavior. Through analytical calculations and numerical simulations, we demonstrate that delays can lead to oscillations, and by incorporating also the ecological variable of altruistic free space and the evolutionary strategy of punishment, we explore how these factors impact population and community dynamics. Depending on the parameter values and the initial fraction of each strategy, the studied eco-evolutionary model can mimic a cyclic dominance system and even exhibit chaotic behavior, thereby highlighting the importance of complex dynamics for the effective management and conservation of ecological communities. Our research thus contributes to the broader understanding of group decision-making and the emergence of moral behavior in multidimensional social systems.

Evolution of cooperation in multiplex networks through asymmetry between interaction and replacement

Cooperation is the foundation of society and has been the subject of numerous studies over the past three decades. However, the mechanisms underlying the spread of cooperation within a group are not yet fully comprehended. We analyze cooperation in multiplex networks, a model that has recently gained attention for successfully capturing certain aspects of human social connections. Previous studies on the evolution of cooperation in multiplex networks have shown that cooperative behavior is promoted when the two key processes in evolution, interaction and strategy replacement, are performed with the same partner as much as possible, that is, symmetrically, in a variety of network structures. We focus on a particular type of symmetry, namely, symmetry in the scope of communication, to investigate whether cooperation is promoted or hindered when interactions and strategy replacements have different scopes. Through multiagent simulations, we found some cases where asymmetry can promote cooperation, contrasting with previous studies. These results hint toward the potential effectiveness of not only symmetrical but also asymmetrical approaches in fostering cooperation within particular groups under certain social conditions.

Data-driven evolutionary game models for the spread of fairness and cooperation in heterogeneous networks

Unique large-scale cooperation and fairness norms are essential to human society, but the emergence of prosocial behaviors is elusive. The fact that heterogeneous social networks prevail raised a hypothesis that heterogeneous networks facilitate fairness and cooperation. However, the hypothesis has not been validated experimentally, and little is known about the evolutionary psychological basis of cooperation and fairness in human networks. Fortunately, research about oxytocin, a neuropeptide, may provide novel ideas for confirming the hypothesis. Recent oxytocin-modulated network game experiments observed that intranasal administration of oxytocin to a few central individuals significantly increases global fairness and cooperation. Here, based on the experimental phenomena and data, we show a joint effect of social preference and network heterogeneity on promoting prosocial behaviors by building evolutionary game models. In the network ultimatum game and the prisoner's dilemma game with punishment, inequality aversion can lead to the spread of costly punishment for selfish and unfair behaviors. This effect is initiated by oxytocin, then amplified via influential nodes, and finally promotes global cooperation and fairness. In contrast, in the network trust game, oxytocin increases trust and altruism, but these effects are confined locally. These results uncover general oxytocin-initiated mechanisms underpinning fairness and cooperation in human networks.

The evolutionary extortion game of multiple groups in hypernetworks

As a type of zero-determinant strategies, the extortion strategy was found to be an evolutionarily stable strategy in structural groups. However, instead of complex networks structure, this paper focus on a multi-group game in hypernetworks, using the framework of a gift giving game driven by replicator-like dynamics. We find that the extortion is evolutionarily stable in the hypernetwork structure. The extortion game in hypernetworks can promote the emergence of the cooperative behavior compared to the traditional dual-strategy game and the extortion game in complex networks. The results show that the cooperation behavior attracts most of the groups for the smaller benefit value. With the increase of benefit value, cooperators turn into defectors and extortioners, but cooperation behavior still survives in hypernetworks under extreme conditions. Moreover, small-scale groups are more conducive to cooperation.

The role of evolutionary game theory in spatial and non-spatial models of the survival of cooperation in cancer: a review

Evolutionary game theory (EGT) is a branch of mathematics which considers populations of individuals interacting with each other to receive pay-offs. An individual’s pay-off is dependent on the strategy of its opponent(s) as well as on its own, and the higher its pay-off, the higher its reproductive fitness. Its offspring generally inherit its interaction strategy, subject to random mutation. Over time, the composition of the population shifts as different strategies spread or are driven extinct. In the last 25 years there has been a flood of interest in applying EGT to cancer modelling, with the aim of explaining how cancerous mutations spread through healthy tissue and how intercellular cooperation persists in tumour-cell populations. This review traces this body of work from theoretical analyses of well-mixed infinite populations through to more realistic spatial models of the development of cooperation between epithelial cells. We also consider work in which EGT has been used to make experimental predictions about the evolution of cancer, and discuss work that remains to be done before EGT can make large-scale contributions to clinical treatment and patient outcomes.

Evaluating the structure-coefficient theorem of evolutionary game theory

In order to accommodate the empirical fact that population structures are rarely simple, modern studies of evolutionary dynamics allow for complicated and highly heterogeneous spatial structures. As a result, one of the most difficult obstacles lies in making analytical deductions, either qualitative or quantitative, about the long-term outcomes of evolution. The "structure-coefficient" theorem is a well-known approach to this problem for mutation-selection processes under weak selection, but a general method of evaluating the terms it comprises is lacking. Here, we provide such a method for populations of fixed (but arbitrary) size and structure, using easily interpretable demographic measures. This method encompasses a large family of evolutionary update mechanisms and extends the theorem to allow for asymmetric contests to provide a better understanding of the mutation-selection balance under more realistic circumstances. We apply the method to study social goods produced and distributed among individuals in spatially heterogeneous populations, where asymmetric interactions emerge naturally and the outcome of selection varies dramatically, depending on the nature of the social good, the spatial topology, and the frequency with which mutations arise.

Prisoner's Dilemma Game with Cooperation-Defection Dominance Strategies on Correlational Multilayer Networks

As multilayer networks are widely applied in modern society, numerous studies have shown the impact of a multilayer network structure and the network nature on the proportion of cooperators in the network. In this paper, we use Barabási-Albert scale-free networks (BA) and Watts and Strogatz networks (WS) to build a multilayer network structure, and we propose a new strategy-updating rule called "cooperation-defection dominance", which can be likened to dominant and recessive traits in biogenetics. With the newly constructed multilayer network structure and the strategy-updating rules, based on the simulation results, we find that in the BA-BA network, the cooperation dominance strategy can make the networks with different rs show a cooperative trend, while the defection dominance strategy only has an obvious effect on the network cooperation with a larger r. When the BA network is connected to the WS network, we find that the effect of strategy on the proportion of cooperators in the network decreases, and the main influencing factor is the structure of the network. In the three-layer network, the cooperation dominance strategy has a greater impact on the BA network, and the proportion of the cooperators is enhanced more than under the natural evolution strategy, but the promotion effect is still smaller than that of the two-layer BA network because of the WS network. Under the defection dominance strategy, the WS layer appears different from the first two strategies, and we conclude through simulation that when the payoff parameter is at the middle level, its cooperator proportion will be suppressed, and we deduce that the proportion of cooperators and defectors, as well as the payoff, play an important role.

Evolution of cooperation with contextualized behavior

How do networks of social interaction govern the emergence and stability of prosocial behavior? Theoretical studies of this question typically assume unconditional behavior, meaning that an individual either cooperates with all opponents or defects against all opponents-an assumption that produces a pessimistic outlook for the evolution of cooperation, especially in highly connected populations. Although these models may be appropriate for simple organisms, humans have sophisticated cognitive abilities that allow them to distinguish between opponents and social contexts, so they can condition their behavior on the identity of opponents. Here, we study the evolution of cooperation when behavior is conditioned by social context, but behaviors can spill over between contexts. Our mathematical analysis shows that contextualized behavior rescues cooperation across a broad range of population structures, even when the number of social contexts is small. Increasing the number of social contexts further promotes cooperation by orders of magnitude.

Artificial intelligence development races in heterogeneous settings

Regulation of advanced technologies such as Artificial Intelligence (AI) has become increasingly important, given the associated risks and apparent ethical issues. With the great benefits promised from being able to first supply such technologies, safety precautions and societal consequences might be ignored or shortchanged in exchange for speeding up the development, therefore engendering a racing narrative among the developers. Starting from a game-theoretical model describing an idealised technology race in a fully connected world of players, here we investigate how different interaction structures among race participants can alter collective choices and requirements for regulatory actions. Our findings indicate that, when participants portray a strong diversity in terms of connections and peer-influence (e.g., when scale-free networks shape interactions among parties), the conflicts that exist in homogeneous settings are significantly reduced, thereby lessening the need for regulatory actions. Furthermore, our results suggest that technology governance and regulation may profit from the world's patent heterogeneity and inequality among firms and nations, so as to enable the design and implementation of meticulous interventions on a minority of participants, which is capable of influencing an entire population towards an ethical and sustainable use of advanced technologies.

Evolution of cooperation with asymmetric social interactions

How cooperation emerges in human societies is both an evolutionary enigma and a practical problem with tangible implications for societal health. Population structure has long been recognized as a catalyst for cooperation because local interactions facilitate reciprocity. Analysis of population structure typically assumes bidirectional social interactions. But human social interactions are often unidirectional-where one individual has the opportunity to contribute altruistically to another, but not conversely-as the result of organizational hierarchies, social stratification, popularity effects, and endogenous mechanisms of network growth. Here we expand the theory of cooperation in structured populations to account for both uni- and bidirectional social interactions. Even though unidirectional interactions remove the opportunity for reciprocity, we find that cooperation can nonetheless be favored in directed social networks and that cooperation is provably maximized for networks with an intermediate proportion of unidirectional interactions, as observed in many empirical settings. We also identify two simple structural motifs that allow efficient modification of interaction directions to promote cooperation by orders of magnitude. We discuss how our results relate to the concepts of generalized and indirect reciprocity.

Interindividual cooperation mediated by partisanship complicates Madison's cure for "mischiefs of faction"

Political theorists have long argued that enlarging the political sphere to include a greater diversity of interests would cure the ills of factions in a pluralistic society. While the scope of politics has expanded dramatically over the past 75 y, polarization is markedly worse. Motivated by this paradox, we take a bottom-up approach to explore how partisan individual-level dynamics in a diverse (multidimensional) issue space can shape collective-level factionalization via an emergent dimensionality reduction. We extend a model of cultural evolution grounded in evolutionary game theory, in which individuals accumulate benefits through pairwise interactions and imitate (or learn) the strategies of successful others. The degree of partisanship determines the likelihood of learning from individuals of the opposite party. This approach captures the coupling between individual behavior, partisan-mediated opinion dynamics, and an interaction network that changes endogenously according to the evolving interests of individuals. We find that while expanding the diversity of interests can indeed improve both individual and collective outcomes, increasingly high partisan bias promotes a reduction in issue dimensionality via party-based assortment that leads to increasing polarization. When party bias becomes extreme, it also boosts interindividual cooperation, thereby further entrenching extreme polarization and creating a tug-of-war between individual cooperation and societal cohesion. These dangers of extreme partisanship are highest when individuals' interests and opinions are heavily shaped by peers and there is little independent exploration. Overall, our findings highlight the urgency to study polarization in a coupled, multilevel context.

Networks of reliable reputations and cooperation: a review

Reputation has been shown to provide an informal solution to the problem of cooperation in human societies. After reviewing models that connect reputations and cooperation, we address how reputation results from information exchange embedded in a social network that changes endogenously itself. Theoretical studies highlight that network topologies have different effects on the extent of cooperation, since they can foster or hinder the flow of reputational information. Subsequently, we review models and empirical studies that intend to grasp the coevolution of reputations, cooperation and social networks. We identify open questions in the literature concerning how networks affect the accuracy of reputations, the honesty of shared information and the spread of reputational information. Certain network topologies may facilitate biased beliefs and intergroup competition or in-group identity formation that could lead to high cooperation within but conflicts between different subgroups of a network. Our review covers theoretical, experimental and field studies across various disciplines that target these questions and could explain how the dynamics of interactions and reputations help or prevent the establishment and sustainability of cooperation in small- and large-scale societies.

This article is part of the theme issue ‘The language of cooperation: reputation and honest signalling’.

The evolution of trust and trustworthiness

Trust and trustworthiness form the basis for continued social and economic interactions, and they are also fundamental for cooperation, fairness, honesty, and indeed for many other forms of prosocial and moral behaviour. However, trust entails risks, and building a trustworthy reputation requires effort. So how did trust and trustworthiness evolve, and under which conditions do they thrive? To find answers, we operationalize trust and trustworthiness using the trust game with the trustor's investment and the trustee's return of the investment as the two key parameters. We study this game on different networks, including the complete network, random and scale-free networks, and in the well-mixed limit. We show that in all but one case, the network structure has little effect on the evolution of trust and trustworthiness. Specifically, for well-mixed populations, lattices, random and scale-free networks, we find that trust never evolves, while trustworthiness evolves with some probability depending on the game parameters and the updating dynamics. Only for the scale-free network with degree non-normalized dynamics, we find parameter values for which trust evolves but trustworthiness does not, as well as values for which both trust and trustworthiness evolve. We conclude with a discussion about mechanisms that could lead to the evolution of trust and outline directions for future work.

Spatial reciprocity in the evolution of cooperation

Cooperation is key to the survival of all biological systems. The spatial structure of a system constrains who interacts with whom (interaction partner) and who acquires new traits from whom (role model). Understanding when and to what degree a spatial structure affects the evolution of cooperation is an important and challenging topic. Here, we provide an analytical formula to predict when natural selection favours cooperation where the effects of a spatial structure are described by a single parameter. We find that a spatial structure promotes cooperation (spatial reciprocity) when interaction partners overlap role models. When they do not, spatial structure inhibits cooperation even without cooperation dilemmas. Furthermore, a spatial structure in which individuals interact with their role models more often shows stronger reciprocity. Thus, imitating individuals with frequent interactions facilitates cooperation. Our findings are applicable to both pairwise and group interactions and show that strong social ties might hinder, while asymmetric spatial structures for interaction and trait dispersal could promote cooperation.

Lying on networks: The role of structure and topology in promoting honesty

Lies can have a negating impact on governments, companies, and the society as a whole. Understanding the dynamics of lying is therefore of crucial importance across different fields of research. While lying has been studied before in well-mixed populations, it is a fact that real interactions are rarely well-mixed. Indeed, they are usually structured and thus best described by networks. Here we therefore use the Monte Carlo method to study the evolution of lying in the sender-receiver game in a one-parameter family of networks, systematically covering complete networks, small-world networks, and one-dimensional rings. We show that lies that benefit the sender at a cost to the receiver, the so-called black lies, are less likely to proliferate on networks than they do in well-mixed populations. Honesty is thus more likely to evolve, but only when the benefit for the sender is smaller than the cost for the receiver. Moreover, this effect is particularly strong in small-world networks, but less so in the one-dimensional ring. For lies that favor the receiver at a cost to the sender, the so-called altruistic white lies, we show that honesty is also more likely to evolve than it is in well-mixed populations. But contrary to black lies, this effect is more expressed in the one-dimensional ring, whereas in small-world networks it is present only when the cost to the sender is greater than the benefit for the receiver. Last, for lies that benefit both the sender and the receiver, the so-called Pareto white lies, we show that the network structure actually favors the evolution of lying, but this only occurs when the benefit for the sender is slightly greater than the benefit for the receiver. In this case again the small-world topology acts as an amplifier of the effect, while other network topologies fail to do the same. In addition to these main results we discuss several other findings, which together show clearly that the structure of interactions and the overall topology of the network critically determine the dynamics of lying.

Parent-preferred dispersal promotes cooperation in structured populations

Dispersal is a key process for the emergence of social and biological behaviours. Yet, little attention has been paid to dispersal's effects on the evolution of cooperative behaviour in structured populations. To address this issue, we propose two new dispersal modes, parent-preferred and offspring-preferred dispersal, incorporate them into the birth-death update rule, and consider the resultant strategy evolution in the prisoner's dilemma on random-regular, small-world, and scale-free networks, respectively. We find that parent-preferred dispersal favours the evolution of cooperation in these different types of population structures, while offspring-preferred dispersal inhibits the evolution of cooperation in homogeneous populations. On scale-free networks when the strength of parent-preferred dispersal is weak, cooperation can be enhanced at intermediate strengths of offspring-preferred dispersal, and cooperators can coexist with defectors at high strengths of offspring-preferred dispersal. Moreover, our theoretical analysis based on the pair-approximation method corroborates the evolutionary outcomes on random-regular networks. We also incorporate the two new dispersal modes into three other update rules (death-birth, imitation, and pairwise comparison updating), and find that similar results about the effects of parent-preferred and offspring-preferred dispersal can again be observed in the aforementioned different types of population structures. Our work, thus, unveils robust effects of preferential dispersal modes on the evolution of cooperation in different interactive environments.

The effect of network topology on optimal exploration strategies and the evolution of cooperation in a mobile population

We model a mobile population interacting over an underlying spatial structure using a Markov movement model. Interactions take the form of public goods games, and can feature an arbitrary group size. Individuals choose strategically to remain at their current location or to move to a neighbouring location, depending upon their exploration strategy and the current composition of their group. This builds upon previous work where the underlying structure was a complete graph (i.e. there was effectively no structure). Here, we consider alternative network structures and a wider variety of, mainly larger, populations. Previously, we had found when cooperation could evolve, depending upon the values of a range of population parameters. In our current work, we see that the complete graph considered before promotes stability, with populations of cooperators or defectors being relatively hard to replace. By contrast, the star graph promotes instability, and often neither type of population can resist replacement. We discuss potential reasons for this in terms of network topology.

Microbial Ecology: Complex Bacterial Communities Reduce Selection for Antibiotic Resistance

Competition between antibiotic-resistant and -susceptible bacteria is well studied in single-species communities, but less is known about selection for resistance in more complex ecologies. A new experiment shows natural microbial communities can hinder selection by increasing the fitness costs of resistance or by offering protection to drug-sensitive strains.

Environmental feedback promotes the evolution of cooperation in the structured populations

Environment plays a vital role in individual decision-making. In the game process, employing the strategy of the opponent who behaves better is nontrivial for the evolution and maintenance of cooperation, in that such a behavior may assist the player in achieving higher personal interests and more competitive superiorities. Enlightened by this thought, a coevolutionary model where the mechanisms of dynamic environment and preference selection are introduced in the networked prisoner's dilemma game is considered. Individual preference selection is introduced in the strategy update process to probe how the preferences of the latent strategy sources interfere with individual behaviors. The environment defined in the model is not only heterogeneous, but also evolves with the evolution of individual strategies. Through conducting large-scale Monte Carlo simulations, we draw a conclusion that the introduction of evolutionary environment-related preference selection is an effective promoter of cooperation even under a severe temptation. Our exploration indicates that the coevolutionary model may have a practical significance and provide a new insight into the analysis of the origin of cooperation in structured populations for further research.

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.

Swarm intelligence inspired cooperation promotion and symmetry breaking in interdependent networked game

The evolution of a cooperative strategy on multilayer networks is arousing increasing concern. Most of the previous studies assumed that agents can only choose cooperation or defection when interacting with their partners, whereas the actual provisions in real world scenarios might not be discrete, but rather continuous. Furthermore, in evolutionary game, agents often make use of their memory which keeps the most successful strategy in the past, as well as the best current strategy gained by their directed neighbors, to find the best available strategies. Inspired by these observations, we study the impact of the particle swarm optimization (PSO) algorithm on the evolution of cooperation on interdependent networks in the continuous version of spatial prisoner's dilemma games. Following extensive simulations of this setup, we can observe that the introduction of the PSO mechanism on the interdependent networks can promote cooperation strongly, regardless of the network coupling strength. In addition, we find that the increment of coupling strength is more suitable for the propagation of cooperation. More interestingly, we find that when the coupling strength is relatively large, a spontaneous symmetry breaking phenomenon of cooperation occurs between the interdependent networks. To interpret the symmetry breaking phenomenon, we investigate the asynchronous expansion of heterogeneous strategy couples between different networks. Since this work takes cooperation from a more elaborate perspective, we believe that it may provide a deep understanding of the evolution of cooperation in social networks.

Environmental fitness heterogeneity in the Moran process

Many mathematical models of evolution assume that all individuals experience the same environment. Here, we study the Moran process in heterogeneous environments. The population is of finite size with two competing types, which are exposed to a fixed number of environmental conditions. Reproductive rate is determined by both the type and the environment. We first calculate the condition for selection to favour the mutant relative to the resident wild-type. In large populations, the mutant is favoured if and only if the mutant's spatial average reproductive rate exceeds that of the resident. But environmental heterogeneity elucidates an interesting asymmetry between the mutant and the resident. Specifically, mutant heterogeneity suppresses its fixation probability; if this heterogeneity is strong enough, it can even completely offset the effects of selection (including in large populations). By contrast, resident heterogeneity has no effect on a mutant's fixation probability in large populations and can amplify it in small populations.

Environment-based preference selection promotes cooperation in spatial prisoner's dilemma game

The impact of environment on individuals is particularly critical. In evolutionary games, adopting the strategy of the neighbor who performs better is nontrivial for the survival and maintenance of cooperation, in that such an action may help the agents to obtain higher benefit and more obvious evolutionary advantages. Inspired by this idea, we investigate the effect of the environment-based preference selection on the evolution of cooperation in spatial prisoner’s dilemma. A simple rule, incorporating individual preference selection via an adjustable parameter α to explore how the selection of the potential strategy sources influences individual behavior traits, is considered. Because social interaction may not be the only way of generating payoffs, we assume that the individual’s income is also affected by the environment. Besides, taking into account individual differences, we introduce the heterogeneity of the environment. Through numerous computing simulations, we find that environment-based preference selection, which accelerates the microscopic organization of cooperator clusters to resist the aggression of defectors, can truly promote cooperation within a large range of parameters. Our study indicates that the combination of heterogeneity and preference selection may be key for the sustainability of cooperation in structured populations.

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.

Evolutionary dynamics on any population structure

Evolution occurs in populations of reproducing individuals. The structure of a population can affect which traits evolve. Understanding evolutionary game dynamics in structured populations remains difficult. Mathematical results are known for special structures in which all individuals have the same number of neighbours. The general case, in which the number of neighbours can vary, has remained open. For arbitrary selection intensity, the problem is in a computational complexity class that suggests there is no efficient algorithm. Whether a simple solution for weak selection exists has remained unanswered. Here we provide a solution for weak selection that applies to any graph or network. Our method relies on calculating the coalescence times of random walks. We evaluate large numbers of diverse population structures for their propensity to favour cooperation. We study how small changes in population structure-graph surgery-affect evolutionary outcomes. We find that cooperation flourishes most in societies that are based on strong pairwise ties.

Fidelity of parent-offspring transmission and the evolution of social behavior in structured populations

The theoretical investigation of how spatial structure affects the evolution of social behavior has mostly been done under the assumption that parent-offspring strategy transmission is perfect, i.e., for genetically transmitted traits, that mutation is very weak or absent. Here, we investigate the evolution of social behavior in structured populations under arbitrary mutation probabilities. We consider populations of fixed size N, structured such that in the absence of selection, all individuals have the same probability of reproducing or dying (neutral reproductive values are the all same). Two types of individuals, A and B, corresponding to two types of social behavior, are competing; the fidelity of strategy transmission from parent to offspring is tuned by a parameter μ. Social interactions have a direct effect on individual fecundities. Under the assumption of small phenotypic differences (implying weak selection), we provide a formula for the expected frequency of type A individuals in the population, and deduce conditions for the long-term success of one strategy against another. We then illustrate our results with three common life-cycles (Wright-Fisher, Moran Birth-Death and Moran Death-Birth), and specific population structures (graph-structured populations). Qualitatively, we find that some life-cycles (Moran Birth-Death, Wright-Fisher) prevent the evolution of altruistic behavior, confirming previous results obtained with perfect strategy transmission. We also show that computing the expected frequency of altruists on a regular graph may require knowing more than just the graph's size and degree.

Bribery games on inter-dependent regular networks

We examine a scenario of social conflict that is manifest during an interaction between government servants providing a service and citizens who are legally entitled to the service, using evolutionary game-theory in structured populations characterized by an inter-dependent network. Bribe-demands by government servants during such transactions, called harassment bribes, constitute a widespread form of corruption in many countries. We investigate the effect of varying bribe demand made by corrupt officials and the cost of complaining incurred by harassed citizens, on the proliferation of corrupt strategies in the population. We also examine how the connectivity of the various constituent networks affects the spread of corrupt officials in the population. We find that incidents of bribery can be considerably reduced in a network-structured populations compared to mixed populations. Interestingly, we also find that an optimal range for the connectivity of nodes in the citizen's network (signifying the degree of influence a citizen has in affecting the strategy of other citizens in the network) as well as the interaction network aids in the fixation of honest officers. Our results reveal the important role of network structure and connectivity in asymmetric games.

Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks

Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world.

Inclusive fitness in finite populations-effects of heterogeneity and synergy

I review recent results concerning the relationship between the inclusive fitness (IF) effect and standard measures of allele fitness in a finite-population, with attention to the effect of heterogeneity in population structure and nonadditive fitness effects. In both cases, existing theoretical work is somewhat technical and I try to provide a more transparent account. In a heterogeneous population it is known that inclusive fitness will generally fail to incorporate the effects of selection on the distribution of alleles among states unless a reproductive-value weighting is used. But even given that, recent work shows that under certain updating rules, the IF effect can fail to be equivalent to standard measures such as fixation probability. In terms of synergistic fitness effects, I review the result that in the finite population model, the IF effect can be calculated using only "additive" relatedness coefficients so that computational difficulties found in the infinite-population model do not arise. In my own work, there is an interaction here in that my 2012 work on synergy with Maciejewski made an assumption about inclusive fitness that my 2014 work on heterogeneity with Tarnita showed to be wrong. I include (Appendix C) a corrected argument for the 2012 result.

Fixation Probabilities for Any Configuration of Two Strategies on Regular Graphs

Population structure and spatial heterogeneity are integral components of evolutionary dynamics, in general, and of evolution of cooperation, in particular. Structure can promote the emergence of cooperation in some populations and suppress it in others. Here, we provide results for weak selection to favor cooperation on regular graphs for any configuration, meaning any arrangement of cooperators and defectors. Our results extend previous work on fixation probabilities of rare mutants. We find that for any configuration cooperation is never favored for birth-death (BD) updating. In contrast, for death-birth (DB) updating, we derive a simple, computationally tractable formula for weak selection to favor cooperation when starting from any configuration containing any number of cooperators. This formula elucidates two important features: (i) the takeover of cooperation can be enhanced by the strategic placement of cooperators and (ii) adding more cooperators to a configuration can sometimes suppress the evolution of cooperation. These findings give a formal account for how selection acts on all transient states that appear in evolutionary trajectories. They also inform the strategic design of initial states in social networks to maximally promote cooperation. We also derive general results that characterize the interaction of any two strategies, not only cooperation and defection.

Evolutionary consequences of behavioral diversity

Iterated games provide a framework to describe social interactions among groups of individuals. This body of work has focused primarily on individuals who face a simple binary choice, such as "cooperate" or "defect." Real individuals, however, can exhibit behavioral diversity, varying their input to a social interaction both qualitatively and quantitatively. Here we explore how access to a greater diversity of behavioral choices impacts the evolution of social dynamics in populations. We show that, in public goods games, some simple strategies that choose between only two possible actions can resist invasion by all multichoice invaders, even while engaging in relatively little punishment. More generally, access to a larger repertoire of behavioral choices results in a more "rugged" fitness landscape, with populations able to stabilize cooperation at multiple levels of investment. As a result, increased behavioral choice facilitates cooperation when returns on investments are low, but it hinders cooperation when returns on investments are high. Finally, we analyze iterated rock-paper-scissors games, the nontransitive payoff structure of which means that unilateral control is difficult to achieve. Despite this, we find that a large proportion of multichoice strategies can invade and resist invasion by single-choice strategies-so that even well-mixed populations will tend to evolve and maintain behavioral diversity.

Evolutionary Games of Multiplayer Cooperation on Graphs

There has been much interest in studying evolutionary games in structured populations, often modeled as graphs. However, most analytical results so far have only been obtained for two-player or linear games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games on graphs updated with a Moran death-Birth process. For cycles, we obtain an exact analytical condition for cooperation to be favored by natural selection, given in terms of the payoffs of the game and a set of structure coefficients. For regular graphs of degree three and larger, we estimate this condition using a combination of pair approximation and diffusion approximation. For a large class of cooperation games, our approximations suggest that graph-structured populations are stronger promoters of cooperation than populations lacking spatial structure. Computer simulations validate our analytical approximations for random regular graphs and cycles, but show systematic differences for graphs with many loops such as lattices. In particular, our simulation results show that these kinds of graphs can even lead to more stringent conditions for the evolution of cooperation than well-mixed populations. Overall, we provide evidence suggesting that the complexity arising from many-player interactions and spatial structure can be captured by pair approximation in the case of random graphs, but that it need to be handled with care for graphs with high clustering.

Cooperation can be defined as the act of providing fitness benefits to other individuals, often at a personal cost. When interactions occur mainly with neighbors, assortment of strategies can favor cooperation but local competition can undermine it. Previous research has shown that a single coefficient can capture this trade-off when cooperative interactions take place between two players. More complicated, but also more realistic, models of cooperative interactions involving multiple players instead require several such coefficients, making it difficult to assess the effects of population structure. Here, we obtain analytical approximations for the coefficients of multiplayer games in graph-structured populations. Computer simulations show that, for particular instances of multiplayer games, these approximate coefficients predict the condition for cooperation to be promoted in random graphs well, but fail to do so in graphs with more structure, such as lattices. Our work extends and generalizes established results on the evolution of cooperation on graphs, but also highlights the importance of explicitly taking into account higher-order statistical associations in order to assess the evolutionary dynamics of cooperation in spatially structured populations.

Structural symmetry in evolutionary games

In evolutionary game theory, an important measure of a mutant trait (strategy) is its ability to invade and take over an otherwise-monomorphic population. Typically, one quantifies the success of a mutant strategy via the probability that a randomly occurring mutant will fixate in the population. However, in a structured population, this fixation probability may depend on where the mutant arises. Moreover, the fixation probability is just one quantity by which one can measure the success of a mutant; fixation time, for instance, is another. We define a notion of homogeneity for evolutionary games that captures what it means for two single-mutant states, i.e. two configurations of a single mutant in an otherwise-monomorphic population, to be 'evolutionarily equivalent' in the sense that all measures of evolutionary success are the same for both configurations. Using asymmetric games, we argue that the term 'homogeneous' should apply to the evolutionary process as a whole rather than to just the population structure. For evolutionary matrix games in graph-structured populations, we give precise conditions under which the resulting process is homogeneous. Finally, we show that asymmetric matrix games can be reduced to symmetric games if the population structure possesses a sufficient degree of symmetry.

Lumping evolutionary game dynamics on networks

We study evolutionary game dynamics on networks (EGN), where players reside in the vertices of a graph, and games are played between neighboring vertices. The model is described by a system of ordinary differential equations which depends on players payoff functions, as well as on the adjacency matrix of the underlying graph. Since the number of differential equations increases with the number of vertices in the graph, the analysis of EGN becomes hard for large graphs. Building on the notion of lumpability for Markov chains, we identify conditions on the network structure allowing to reduce the original graph. In particular, we identify a partition of the vertex set of the graph and show that players in the same block of a lumpable partition have equivalent dynamical behaviors, whenever their payoff functions and initial conditions are equivalent. Therefore, vertices belonging to the same partition block can be merged into a single vertex, giving rise to a reduced graph and consequently to a simplified system of equations. We also introduce a tighter condition, called strong lumpability, which can be used to identify dynamical symmetries in EGN which are related to the interchangeability of players in the system.

Intermediate-Range Migration Furnishes a Narrow Margin of Efficiency in the Two-Strategy Competition

It is well-known that the effects of spatial selection on the two-strategy competition can be quantified by the structural coefficient σ under weak selection. We here calculate the accurate value of σ in group-structured populations of any finite size. In previous similar models, the large population size has been explicitly required for obtaining σ, and here we analyze quantitatively how large the population should be. Unlike previous models which have only involved the influences of the longest and the shortest migration rang on σ, we consider all migration ranges together. The new phenomena are that an intermediate range maximizes σ for medium migration probabilities which are of the tiny minority and the maximum value is slightly larger than those for other ranges. Furthermore, we find the ways that migration or mutation changes σ can vary significantly through determining analytically how the high-frequency steady states (distributions of either strategy over all groups) impact the expression of σ obtained before. Our findings can be directly used to resolve the dilemma of cooperation and provide a more intuitive understanding of spatial selection.

Linking Individual and Collective Behavior in Adaptive Social Networks

Adaptive social structures are known to promote the evolution of cooperation. However, up to now the characterization of the collective, population-wide dynamics resulting from the self-organization of individual strategies on a coevolving, adaptive network has remained unfeasible. Here we establish a (reversible) link between individual (micro)behavior and collective (macro)behavior for coevolutionary processes. We demonstrate that an adaptive network transforms a two-person social dilemma locally faced by individuals into a collective dynamics that resembles that associated with an N-person coordination game, whose characterization depends sensitively on the relative time scales between the entangled behavioral and network evolutions. In particular, we show that the faster the relative rate of adaptation of the network, the smaller the critical fraction of cooperators required for cooperation to prevail, thus establishing a direct link between network adaptation and the evolution of cooperation. The framework developed here is general and may be readily applied to other dynamical processes occurring on adaptive networks, notably, the spreading of contagious diseases or the diffusion of innovations.

Topological chaos of the spatial prisoner's dilemma game on regular networks

The spatial version of evolutionary prisoner's dilemma on infinitely large regular lattice with purely deterministic strategies and no memories among players is investigated in this paper. Based on the statistical inferences, it is pertinent to confirm that the frequency of cooperation for characterizing its macroscopic behaviors is very sensitive to the initial conditions, which is the most practically significant property of chaos. Its intrinsic complexity is then justified on firm ground from the theory of symbolic dynamics; that is, this game is topologically mixing and possesses positive topological entropy on its subsystems. It is demonstrated therefore that its frequency of cooperation could not be adopted by simply averaging over several steps after the game reaches the equilibrium state. Furthermore, the chaotically changing spatial patterns via empirical observations can be defined and justified in view of symbolic dynamics. It is worth mentioning that the procedure proposed in this work is also applicable to other deterministic spatial evolutionary games therein.

Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process?

Evolution in finite populations is often modelled using the classical Moran process. Over the last 10 years, this methodology has been extended to structured populations using evolutionary graph theory. An important question in any such population is whether a rare mutant has a higher or lower chance of fixating (the fixation probability) than the Moran probability, i.e. that from the original Moran model, which represents an unstructured population. As evolutionary graph theory has developed, different ways of considering the interactions between individuals through a graph and an associated matrix of weights have been considered, as have a number of important dynamics. In this paper, we revisit the original paper on evolutionary graph theory in light of these extensions to consider these developments in an integrated way. In particular, we find general criteria for when an evolutionary graph with general weights satisfies the Moran probability for the set of six common evolutionary dynamics.

Asymmetric Evolutionary Games

Evolutionary game theory is a powerful framework for studying evolution in populations of interacting individuals. A common assumption in evolutionary game theory is that interactions are symmetric, which means that the players are distinguished by only their strategies. In nature, however, the microscopic interactions between players are nearly always asymmetric due to environmental effects, differing baseline characteristics, and other possible sources of heterogeneity. To model these phenomena, we introduce into evolutionary game theory two broad classes of asymmetric interactions: ecological and genotypic. Ecological asymmetry results from variation in the environments of the players, while genotypic asymmetry is a consequence of the players having differing baseline genotypes. We develop a theory of these forms of asymmetry for games in structured populations and use the classical social dilemmas, the Prisoner’s Dilemma and the Snowdrift Game, for illustrations. Interestingly, asymmetric games reveal essential differences between models of genetic evolution based on reproduction and models of cultural evolution based on imitation that are not apparent in symmetric games.

Biological interactions, even between members of the same species, are almost always asymmetric due to differences in size, access to resources, or past interactions. However, classical game-theoretical models of evolution fail to account for sources of asymmetry in a comprehensive manner. Here, we extend the theory of evolutionary games to two general classes of asymmetry arising from environmental variation and individual differences, covering much of the heterogeneity observed in nature. If selection is weak, evolutionary processes based on asymmetric interactions behave macroscopically like symmetric games with payoffs that may depend on the resource distribution in the population or its structure. Asymmetry uncovers differences between genetic and cultural evolution that are not apparent when interactions are symmetric.

Evolutionary dynamics of fairness on graphs with migration

Individual migration plays a crucial role in evolutionary dynamics of population on networks. In this paper, we generalize the networked ultimatum game by diluting population structures as well as endowing individuals with migration ability, and investigate evolutionary dynamics of fairness on graphs with migration in the ultimatum game. We first revisit the impact of node degree on the evolution of fairness. Interestingly, numerical simulations reveal that there exists an optimal value of node degree resulting in the maximal offer level of populations. Then we explore the effects of dilution and migration on the evolution of fairness, and find that both the dilution of population structures and the endowment of migration ability to individuals would lead to the drop of offer level, while the rise of acceptance level of populations. Notably, natural selection even favors the evolution of self-incompatible strategies, when either vacancy rate or migration rate exceeds a critical threshold. To confirm our simulation results, we also propose an analytical method to study the evolutionary dynamics of fairness on graphs with migration. This method can be applied to explore any games governed by pairwise interactions in finite populations.

Crucial role of strategy updating for coexistence of strategies in interaction networks

Network models are useful tools for studying the dynamics of social interactions in a structured population. After a round of interactions with the players in their local neighborhood, players update their strategy based on the comparison of their own payoff with the payoff of one of their neighbors. Here we show that the assumptions made on strategy updating are of crucial importance for the strategy dynamics. In the first step, we demonstrate that seemingly small deviations from the standard assumptions on updating have major implications for the evolutionary outcome of two cooperation games: cooperation can more easily persist in a Prisoner's Dilemma game, while it can go more easily extinct in a Snowdrift game. To explain these outcomes, we develop a general model for the updating of states in a network that allows us to derive conditions for the steady-state coexistence of states (or strategies). The analysis reveals that coexistence crucially depends on the number of agents consulted for updating. We conclude that updating rules are as important for evolution on a network as network structure and the nature of the interaction.

Evolution of individual versus social learning on social networks

A number of studies have investigated the roles played by individual and social learning in cultural phenomena and the relative advantages of the two learning strategies in variable environments. Because social learning involves the acquisition of behaviours from others, its utility depends on the availability of 'cultural models' exhibiting adaptive behaviours. This indicates that social networks play an essential role in the evolution of learning. However, possible effects of social structure on the evolution of learning have not been fully explored. Here, we develop a mathematical model to explore the evolutionary dynamics of learning strategies on social networks. We first derive the condition under which social learners (SLs) are selectively favoured over individual learners in a broad range of social network. We then obtain an analytical approximation of the long-term average frequency of SLs in homogeneous networks, from which we specify the condition, in terms of three relatedness measures, for social structure to facilitate the long-term evolution of social learning. Finally, we evaluate our approximation by Monte Carlo simulations in complete graphs, regular random graphs and scale-free networks. We formally show that whether social structure favours the evolution of social learning is determined by the relative magnitudes of two effects of social structure: localization in competition, by which competition between learning strategies is evaded, and localization in cultural transmission, which slows down the spread of adaptive traits. In addition, our estimates of the relatedness measures suggest that social structure disfavours the evolution of social learning when selection is weak.

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.