Emergent hierarchical structures in multiadaptive games

Mixing protocols in the public goods game

If interaction partners in social dilemma games are not selected randomly from the population but are instead determined by a network of contacts, it has far reaching consequences for the evolutionary dynamics. Selecting partners randomly leads to a well-mixed population, where pattern formation is essentially impossible. This rules out important mechanisms that can facilitate cooperation, most notably network reciprocity. In contrast, if interactions are determined by a lattice or a network, then the population is said to be structured, where cooperators can form compact clusters that protect them from invading defectors. Between these two extremes, however, there is ample middle ground that can be brought about by the consideration of temporal networks, mobility, or other coevolutionary processes. The question that we here seek to answer is, when does mixing on a lattice actually lead to well-mixed conditions? To that effect, we use the public goods game on a square lattice, and we consider nearest-neighbor and random mixing with different frequencies, as well as a mix of both mixing protocols. Not surprisingly, we find that nearest-neighbor mixing requires a higher frequency than random mixing to arrive at the well-mixed limit. The differences between the two mixing protocols are most expressed at intermediate mixing frequencies, whilst at very low and very high mixing frequencies the two almost converge. We also find a near universal exponential growth of the average size of cooperator clusters as their fraction increases from zero to one, regardless of whether this increase is due to increasing the multiplication factor of the public goods, decreasing the frequency of mixing, or gradually shifting the mixing from random to nearest neighbors.

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.

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.

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.

Aspiration induced interdependence leads to optimal cooperation level

How to couple different networks is a key issue in interdependent networks, where information sharing and payoff coupling are two frequently used methods. Unlike previous studies, in this paper, we propose a new coupling mode and test its performance in interdependent networks. Specifically, a player tends to seek additional support on another network only if his environment (defined as the proportion of holding different strategies in the neighborhood) is worse enough and exceeds an aspiration level. Conversely, it turns to the traditional version on single network if his environment is pleasing enough (the value of environment is small). Whether to establish additional support will directly influence the range of selecting fittest learning objects. As we can see from numerical results, moderate aspiration introduces diversity into the system and cooperation evolves with the support of network coupling. Besides, we also demonstrate that players with external links on the boundary of cooperative clusters protect internal cooperators and attract more players to cooperate under preferential selection rule.

Identification of influential invaders in evolutionary populations

The identification of the most influential nodes has been a vibrant subject of research across the whole of network science. Here we map this problem to structured evolutionary populations, where strategies and the interaction network are both subject to change over time based on social inheritance. We study cooperative communities, which cheaters can invade because they avoid the cost of contributions that are associated with cooperation. The question that we seek to answer is at which nodes cheaters invade most successfully. We propose the weighted degree decomposition to identify and rank the most influential invaders. More specifically, we distinguish two kinds of ranking based on the weighted degree decomposition. We show that a ranking strategy based on negative-weighted degree allows to successfully identify the most influential invaders in the case of weak selection, while a ranking strategy based on positive-weighted degree performs better when the selection is strong. Our research thus reveals how to identify the most influential invaders based on statistical measures in dynamically evolving cooperative communities.

Bribery games on interdependent complex networks

Bribe demands present a social conflict scenario where decisions have wide-ranging economic and ethical consequences. Nevertheless, such incidents occur daily in many countries across the globe. Harassment bribery constitute a significant sub-set of such bribery incidents where a government official demands a bribe for providing a service to a citizen legally entitled to it. We employ an evolutionary game-theoretic framework to analyse the evolution of corrupt and honest strategies in structured populations characterized by an interdependent complex network. The effects of changing network topology, average number of links and asymmetry in size of the citizen and officer population on the proliferation of incidents of bribery are explored. A complex network topology is found to be beneficial for the dominance of corrupt strategies over a larger region of phase space when compared with the outcome for a regular network, for equal citizen and officer population sizes. However, the extent of the advantage depends critically on the network degree and topology. A different trend is observed when there is a difference between the citizen and officer population sizes. Under those circumstances, increasing randomness of the underlying citizen network can be beneficial to the fixation of honest officers up to a certain value of the network degree. Our analysis reveals how the interplay between network topology, connectivity and strategy update rules can affect population level outcomes in such asymmetric games.

Glassy nature of hierarchical organizations

The question of why and how animal and human groups form temporarily stable hierarchical organizations has long been a great challenge from the point of quantitative interpretations. The prevailing observation/consensus is that a hierarchical social or technological structure is optimal considering a variety of aspects. Here we introduce a simple quantitative interpretation of this situation using a statistical mechanics-type approach. We look for the optimum of the efficiency function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${E}_{eff}=1/N{\sum }_{ij}{J}_{ij}{a}_{i}{a}_{j}$$\end{document}Eeff=1/N∑ijJijaiaj with J_ij denoting the nature of the interaction between the units i and j and a_i standing for the ability of member i to contribute to the efficiency of the system. Notably, this expression for E_eff has a similar structure to that of the energy as defined for spin-glasses. Unconventionally, we assume that J_ij-s can have the values 0 (no interaction), +1 and −1; furthermore, a direction is associated with each edge. The essential and novel feature of our approach is that instead of optimizing the state of the nodes of a pre-defined network, we search for extrema for given a_i-s in the complex efficiency landscape by finding locally optimal network topologies for a given number of edges of the subgraphs considered.

Role-separating ordering in social dilemmas controlled by topological frustration

''Three is a crowd" is an old proverb that applies as much to social interactions as it does to frustrated configurations in statistical physics models. Accordingly, social relations within a triangle deserve special attention. With this motivation, we explore the impact of topological frustration on the evolutionary dynamics of the snowdrift game on a triangular lattice. This topology provides an irreconcilable frustration, which prevents anticoordination of competing strategies that would be needed for an optimal outcome of the game. By using different strategy updating protocols, we observe complex spatial patterns in dependence on payoff values that are reminiscent to a honeycomb-like organization, which helps to minimize the negative consequence of the topological frustration. We relate the emergence of these patterns to the microscopic dynamics of the evolutionary process, both by means of mean-field approximations and Monte Carlo simulations. For comparison, we also consider the same evolutionary dynamics on the square lattice, where of course the topological frustration is absent. However, with the deletion of diagonal links of the triangular lattice, we can gradually bridge the gap to the square lattice. Interestingly, in this case the level of cooperation in the system is a direct indicator of the level of topological frustration, thus providing a method to determine frustration levels in an arbitrary interaction network.

Evolution of cooperative imitators in social networks

Many evolutionary game models for network reciprocity are based on an imitation dynamics, yet how semirational imitators prevail has seldom been explained. Here we use a model to investigate the coevolutionary dynamics of cooperation and partnership adjustment in a polygenic population of semirational imitators and rational payoff maximizers. A rational individual chooses a strategy best responding to its neighbors when updating strategy and switches to a new partner who can bring it the maximal payoff from all candidates when adjusting the partnership. In contrast, a semirational individual imitates its neighbor's strategy directly and adjusts its partnership based upon a simple reputation rule. Individual-based simulations show that cooperation cannot evolve in a population of all best responders even if they can switch their partners to somebody who can reward them best in game playing. However, when imitators exist, a stable community that consists of cooperative imitators emerges. Further, we show that a birth-death selection mechanism can eliminate all best responders, cultivating a social regime of all cooperative imitators. Compared with parallel simulations that assume fixed networks, cooperative imitators are evolutionarily favored, provided they are able to adjust their partners.

From degree-correlated to payoff-correlated activity for an optimal resolution of social dilemmas

An active participation of players in evolutionary games depends on several factors, ranging from personal stakes to the properties of the interaction network. Diverse activity patterns thus have to be taken into account when studying the evolution of cooperation in social dilemmas. Here we study the weak prisoner's dilemma game, where the activity of each player is determined in a probabilistic manner either by its degree or by its payoff. While degree-correlated activity introduces cascading failures of cooperation that are particularly severe on scale-free networks with frequently inactive hubs, payoff-correlated activity provides a more nuanced activity profile, which ultimately hinders systemic breakdowns of cooperation. To determine optimal conditions for the evolution of cooperation, we introduce an exponential decay to payoff-correlated activity that determines how fast the activity of a player returns to its default state. We show that there exists an intermediate decay rate at which the resolution of the social dilemma is optimal. This can be explained by the emerging activity patterns of players, where the inactivity of hubs is compensated effectively by the increased activity of average-degree players, who through their collective influence in the network sustain a higher level of cooperation. The sudden drops in the fraction of cooperators observed with degree-correlated activity therefore vanish, and so does the need for the lengthy spatiotemporal reorganization of compact cooperative clusters. The absence of such asymmetric dynamic instabilities thus leads to an optimal resolution of social dilemmas, especially when the conditions for the evolution of cooperation are strongly adverse.

Leaders should not be conformists in evolutionary social dilemmas

The most common assumption in evolutionary game theory is that players should adopt a strategy that warrants the highest payoff. However, recent studies indicate that the spatial selection for cooperation is enhanced if an appropriate fraction of the population chooses the most common rather than the most profitable strategy within the interaction range. Such conformity might be due to herding instincts or crowd behavior in humans and social animals. In a heterogeneous population where individuals differ in their degree, collective influence, or other traits, an unanswered question remains who should conform. Selecting conformists randomly is the simplest choice, but it is neither a realistic nor the optimal one. We show that, regardless of the source of heterogeneity and game parametrization, socially the most favorable outcomes emerge if the masses conform. On the other hand, forcing leaders to conform significantly hinders the constructive interplay between heterogeneity and coordination, leading to evolutionary outcomes that are worse still than if conformists were chosen randomly. We conclude that leaders must be able to create a following for network reciprocity to be optimally augmented by conformity. In the opposite case, when leaders are castrated and made to follow, the failure of coordination impairs the evolution of cooperation.

Collective punishment is more effective than collective reward for promoting cooperation

Collective punishment and reward are usually regarded as two potential mechanisms to explain the evolution of cooperation. Both scenarios, however, seem problematic to understand cooperative behavior, because they can raise the second-order free-rider problem and many organisms are not able to discriminate less cooperating individuals. Even though they have been proved to increase cooperation, there has been a debate about which one being more effective. To address this issue, we resort to the N-player evolutionary snowdrift game (NESG), where a collective punishment/reward mechanism is added by allowing some players to display punishment/reward towards all remaining players. By means of numerous simulations and analyses, we find that collective punishment is more effective in promoting cooperation for a relatively high initial frequency of cooperation or for a relatively small group. When the intensity of punishment exceeds a certain threshold, a stable state of full cooperation emerges for both small and large groups. In contrast, such state does not appear for large groups playing a NESG with reward mechanism. In the case of mutualistic interactions, finally, our results show the new payoff with collective punishment/reward can lead to the coexistence of cooperators and defectors when discrimination between these two is not possible.

Coupled disease-behavior dynamics on complex networks: A review

It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years.

Universal scaling for the dilemma strength in evolutionary games

Why would natural selection favor the prevalence of cooperation within the groups of selfish individuals? A fruitful framework to address this question is evolutionary game theory, the essence of which is captured in the so-called social dilemmas. Such dilemmas have sparked the development of a variety of mathematical approaches to assess the conditions under which cooperation evolves. Furthermore, borrowing from statistical physics and network science, the research of the evolutionary game dynamics has been enriched with phenomena such as pattern formation, equilibrium selection, and self-organization. Numerous advances in understanding the evolution of cooperative behavior over the last few decades have recently been distilled into five reciprocity mechanisms: direct reciprocity, indirect reciprocity, kin selection, group selection, and network reciprocity. However, when social viscosity is introduced into a population via any of the reciprocity mechanisms, the existing scaling parameters for the dilemma strength do not yield a unique answer as to how the evolutionary dynamics should unfold. Motivated by this problem, we review the developments that led to the present state of affairs, highlight the accompanying pitfalls, and propose new universal scaling parameters for the dilemma strength. We prove universality by showing that the conditions for an ESS and the expressions for the internal equilibriums in an infinite, well-mixed population subjected to any of the five reciprocity mechanisms depend only on the new scaling parameters. A similar result is shown to hold for the fixation probability of the different strategies in a finite, well-mixed population. Furthermore, by means of numerical simulations, the same scaling parameters are shown to be effective even if the evolution of cooperation is considered on the spatial networks (with the exception of highly heterogeneous setups). We close the discussion by suggesting promising directions for future research including (i) how to handle the dilemma strength in the context of co-evolution and (ii) where to seek opportunities for applying the game theoretical approach with meaningful impact.

Analytical description for the critical fixations of evolutionary coordination games on finite complex structured populations

Evolutionary game theory is crucial to capturing the characteristic interaction patterns among selfish individuals. In a population of coordination games of two strategies, one of the central problems is to determine the fixation probability that the system reaches a state of networkwide of only one strategy, and the corresponding expectation times. The deterministic replicator equations predict the critical value of initial density of one strategy, which separates the two absorbing states of the system. However, numerical estimations of this separatrix show large deviations from the theory in finite populations. Here we provide a stochastic treatment of this dynamic process on complex networks of finite sizes as Markov processes, showing the evolutionary time explicitly. We describe analytically the effects of network structures on the intermediate fixations as observed in numerical simulations. Our theoretical predictions are validated by various simulations on both random and scale free networks. Therefore, our stochastic framework can be helpful in dealing with other networked game dynamics.

Conformity enhances network reciprocity in evolutionary social dilemmas

The pursuit of highest payoffs in evolutionary social dilemmas is risky and sometimes inferior to conformity. Choosing the most common strategy within the interaction range is safer because it ensures that the payoff of an individual will not be much lower than average. Herding instincts and crowd behaviour in humans and social animals also compel to conformity in their own right. Motivated by these facts, we here study the impact of conformity on the evolution of cooperation in social dilemmas. We show that an appropriate fraction of conformists within the population introduces an effective surface tension around cooperative clusters and ensures smooth interfaces between different strategy domains. Payoff-driven players brake the symmetry in favour of cooperation and enable an expansion of clusters past the boundaries imposed by traditional network reciprocity. This mechanism works even under the most testing conditions, and it is robust against variations of the interaction network as long as degree-normalized payoffs are applied. Conformity may thus be beneficial for the resolution of social dilemmas.

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.

Punishment based on public benefit fund significantly promotes cooperation

In prisoner's dilemma game (shortly, PD game), punishment is most frequently used to promote cooperation. However, outcome varies when different punishment approaches are applied. Here the PD game is studied on a square lattice when different punishment patterns are adopted. As is known to all, tax system, a common tool to adjust the temperature of the economy, is widely used in human society. Inspired by this philosophy, players in this study would pay corresponding taxes in accordance with their payoff level. In this way, public benefit fund is established consequently and it would be utilized to punish defectors. There are two main methods for punishing: slight intensity of punishment (shortly, SLP) and severe intensity of punishment (shortly, SEP). When the totaling of public benefit fund keeps relatively fixed, SLP extends further, which means more defectors would be punished; by contrast, SEP has a smaller coverage. It is of interest to verify whether these two measures can promote cooperation and which one is more efficient. Simulate results reveal that both of them can promote cooperation remarkably. Specifically speaking, SLP shows constant advantage from the point of view either of fractions of cooperation or average payoff.

The evolution of reputation-based partner-switching behaviors with a cost

Humans constantly adjust their social relationships and choose new partners of good reputations, thereby promoting the evolution of cooperation. Individuals have to pay a cost to build a reputation, obtain others' information and then make partnership adjustments, yet the conditions under which such costly behaviors are able to evolve remain to be explored. In this model, I assume that individuals have to pay a cost to adjust their partnerships. Furthermore, whether an individual can adjust his partnership based on reputation is determined by his strategic preference, which is updated via coevolution. Using the metaphor of a public goods game where the collective benefit is shared among all members of a group, the coupling dynamics of cooperation and partnership adjustment were numerically simulated. Partner-switching behavior cannot evolve in a public goods game with a low amplification factor. However, such an effect can be exempted by raising the productivity of public goods or the frequency of partnership adjustment. Moreover, costly partner-switching behavior is remarkably promoted by the condition that the mechanism of reputation evaluation considers its prosociality. A mechanism of reputation evaluation that praises both cooperative and partner-switching behaviors allows them to coevolve.

Degree mixing in multilayer networks impedes the evolution of cooperation

Traditionally, the evolution of cooperation has been studied on single, isolated networks. Yet a player, especially in human societies, will typically be a member of many different networks, and those networks will play different roles in the evolutionary process. Multilayer networks are therefore rapidly gaining on popularity as the more apt description of a networked society. With this motivation, we here consider two-layer scale-free networks with all possible combinations of degree mixing, wherein one network layer is used for the accumulation of payoffs and the other is used for strategy updating. We find that breaking the symmetry through assortative mixing in one layer and/or disassortative mixing in the other layer, as well as preserving the symmetry by means of assortative mixing in both layers, impedes the evolution of cooperation. We use degree-dependent distributions of strategies and cluster-size analysis to explain these results, which highlight the importance of hubs and the preservation of symmetry between multilayer networks for the successful resolution of social dilemmas.

Evolution of extortion in structured populations

Extortion strategies can dominate any opponent in an iterated prisoner's dilemma game. But if players are able to adopt the strategies performing better, extortion becomes widespread and evolutionary unstable. It may sometimes act as a catalyst for the evolution of cooperation, and it can also emerge in interactions between two populations, yet it is not the evolutionarily stable outcome. Here we revisit these results in the realm of spatial games. We find that pairwise imitation and birth-death dynamics return known evolutionary outcomes. Myopic best response strategy updating, on the other hand, reveals counterintuitive solutions. Defectors and extortioners coarsen spontaneously, which allows cooperators to prevail even at prohibitively high temptations to defect. Here extortion strategies play the role of a Trojan horse. They may emerge among defectors by chance, and once they do, cooperators become viable as well. These results are independent of the interaction topology, and they highlight the importance of coarsening, checkerboard ordering, and best response updating in evolutionary games.

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.

Hierarchical self-organization of non-cooperating individuals

Hierarchy is one of the most conspicuous features of numerous natural, technological and social systems. The underlying structures are typically complex and their most relevant organizational principle is the ordering of the ties among the units they are made of according to a network displaying hierarchical features. In spite of the abundant presence of hierarchy no quantitative theoretical interpretation of the origins of a multi-level, knowledge-based social network exists. Here we introduce an approach which is capable of reproducing the emergence of a multi-levelled network structure based on the plausible assumption that the individuals (representing the nodes of the network) can make the right estimate about the state of their changing environment to a varying degree. Our model accounts for a fundamental feature of knowledge-based organizations: the less capable individuals tend to follow those who are better at solving the problems they all face. We find that relatively simple rules lead to hierarchical self-organization and the specific structures we obtain possess the two, perhaps most important features of complex systems: a simultaneous presence of adaptability and stability. In addition, the performance (success score) of the emerging networks is significantly higher than the average expected score of the individuals without letting them copy the decisions of the others. The results of our calculations are in agreement with a related experiment and can be useful from the point of designing the optimal conditions for constructing a given complex social structure as well as understanding the hierarchical organization of such biological structures of major importance as the regulatory pathways or the dynamics of neural networks.

Spontaneous centralization of control in a network of company ownerships

We introduce a model for the adaptive evolution of a network of company ownerships. In a recent work it has been shown that the empirical global network of corporate control is marked by a central, tightly connected “core” made of a small number of large companies which control a significant part of the global economy. Here we show how a simple, adaptive “rich get richer” dynamics can account for this characteristic, which incorporates the increased buying power of more influential companies, and in turn results in even higher control. We conclude that this kind of centralized structure can emerge without it being an explicit goal of these companies, or as a result of a well-organized strategy.

Decelerated invasion and waning-moon patterns in public goods games with delayed distribution

We study the evolution of cooperation in the spatial public goods game, focusing on the effects that are brought about by the delayed distribution of goods that accumulate in groups due to the continuous investments of cooperators. We find that intermediate delays enhance network reciprocity because of a decelerated invasion of defectors, who are unable to reap the same high short-term benefits as they do in the absence of delayed distribution. Long delays, however, introduce a risk because the large accumulated wealth might fall into the wrong hands. Indeed, as soon as the curvature of a cooperative cluster turns negative, the engulfed defectors can collect the heritage of many generations of cooperators and by doing so start a waning-moon pattern that nullifies the benefits of decelerated invasion. Accidental meeting points of growing cooperative clusters may also act as triggers for the waning-moon effect, thus linking the success of cooperators with their propensity to fail in a rather bizarre way. Our results highlight that "investing in the future" is a good idea only if that future is sufficiently near and not likely to be burdened by inflation.

Evolution of emotions on networks leads to the evolution of cooperation in social dilemmas

We show that the resolution of social dilemmas in random graphs and scale-free networks is facilitated by imitating not the strategy of better-performing players but, rather, their emotions. We assume sympathy and envy to be the two emotions that determine the strategy of each player in any given interaction, and we define them as the probabilities of cooperating with players having a lower and a higher payoff, respectively. Starting with a population where all possible combinations of the two emotions are available, the evolutionary process leads to a spontaneous fixation to a single emotional profile that is eventually adopted by all players. However, this emotional profile depends not only on the payoffs but also on the heterogeneity of the interaction network. Homogeneous networks, such as lattices and regular random graphs, lead to fixations that are characterized by high sympathy and high envy, while heterogeneous networks lead to low or modest sympathy but also low envy. Our results thus suggest that public emotions and the propensity to cooperate at large depend, and are in fact determined by, the properties of the interaction network.

Interdependent network reciprocity in evolutionary games

Besides the structure of interactions within networks, also the interactions between networks are of the outmost importance. We therefore study the outcome of the public goods game on two interdependent networks that are connected by means of a utility function, which determines how payoffs on both networks jointly influence the success of players in each individual network. We show that an unbiased coupling allows the spontaneous emergence of interdependent network reciprocity, which is capable to maintain healthy levels of public cooperation even in extremely adverse conditions. The mechanism, however, requires simultaneous formation of correlated cooperator clusters on both networks. If this does not emerge or if the coordination process is disturbed, network reciprocity fails, resulting in the total collapse of cooperation. Network interdependence can thus be exploited effectively to promote cooperation past the limits imposed by isolated networks, but only if the coordination between the interdependent networks is not disturbed.

Optimal interdependence between networks for the evolution of cooperation

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality.

Beyond pairwise strategy updating in the prisoner's dilemma game

In spatial games players typically alter their strategy by imitating the most successful or one randomly selected neighbor. Since a single neighbor is taken as reference, the information stemming from other neighbors is neglected, which begets the consideration of alternative, possibly more realistic approaches. Here we show that strategy changes inspired not only by the performance of individual neighbors but rather by entire neighborhoods introduce a qualitatively different evolutionary dynamics that is able to support the stable existence of very small cooperative clusters. This leads to phase diagrams that differ significantly from those obtained by means of pairwise strategy updating. In particular, the survivability of cooperators is possible even by high temptations to defect and over a much wider uncertainty range. We support the simulation results by means of pair approximations and analysis of spatial patterns, which jointly highlight the importance of local information for the resolution of social dilemmas.

No need for conspiracy: self-organized cartel formation in a modified trust game

We investigate the dynamics of a trust game on a mixed population, where individuals with the role of buyers are forced to play against a predetermined number of sellers whom they choose dynamically. Agents with the role of sellers are also allowed to adapt the level of value for money of their products, based on payoff. The dynamics undergoes a transition at a specific value of the strategy update rate, above which an emergent cartel organization is observed, where sellers have similar values of below-optimal value for money. This cartel organization is not due to an explicit collusion among agents; instead, it arises spontaneously from the maximization of the individual payoffs. This dynamics is marked by large fluctuations and a high degree of unpredictability for most of the parameter space and serves as a plausible qualitative explanation for observed elevated levels and fluctuations of certain commodity prices.

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.

If players are sparse social dilemmas are too: Importance of percolation for evolution of cooperation

Spatial reciprocity is a well known tour de force of cooperation promotion. A thorough understanding of the effects of different population densities is therefore crucial. Here we study the evolution of cooperation in social dilemmas on different interaction graphs with a certain fraction of vacant nodes. We find that sparsity may favor the resolution of social dilemmas, especially if the population density is close to the percolation threshold of the underlying graph. Regardless of the type of the governing social dilemma as well as particularities of the interaction graph, we show that under pairwise imitation the percolation threshold is a universal indicator of how dense the occupancy ought to be for cooperation to be optimally promoted. We also demonstrate that myopic updating, due to the lack of efficient spread of information via imitation, renders the reported mechanism dysfunctional, which in turn further strengthens its foundations.

Percolation threshold determines the optimal population density for public cooperation

While worldwide census data provide statistical evidence that firmly link the population density with several indicators of social welfare, the precise mechanisms underlying these observations are largely unknown. Here we study the impact of population density on the evolution of public cooperation in structured populations and find that the optimal density is uniquely related to the percolation threshold of the host graph irrespective of its topological details. We explain our observations by showing that spatial reciprocity peaks in the vicinity of the percolation threshold, when the emergence of a giant cooperative cluster is hindered neither by vacancy nor by invading defectors, thus discovering an intuitive yet universal law that links the population density with social prosperity.

Win-stay-lose-learn promotes cooperation in the spatial prisoner's dilemma game

Holding on to one's strategy is natural and common if the later warrants success and satisfaction. This goes against widespread simulation practices of evolutionary games, where players frequently consider changing their strategy even though their payoffs may be marginally different than those of the other players. Inspired by this observation, we introduce an aspiration-based win-stay-lose-learn strategy updating rule into the spatial prisoner's dilemma game. The rule is simple and intuitive, foreseeing strategy changes only by dissatisfied players, who then attempt to adopt the strategy of one of their nearest neighbors, while the strategies of satisfied players are not subject to change. We find that the proposed win-stay-lose-learn rule promotes the evolution of cooperation, and it does so very robustly and independently of the initial conditions. In fact, we show that even a minute initial fraction of cooperators may be sufficient to eventually secure a highly cooperative final state. In addition to extensive simulation results that support our conclusions, we also present results obtained by means of the pair approximation of the studied game. Our findings continue the success story of related win-stay strategy updating rules, and by doing so reveal new ways of resolving the prisoner's dilemma.

Cooperative behavior in evolutionary snowdrift games with the unconditional imitation rule on regular lattices

We study an evolutionary snowdrift game with the unconditional imitation updating rule on regular lattices. Detailed numerical simulations establish the structure of plateaus and discontinuous jumps of the equilibrium cooperation frequency f(c) as a function of the cost-to-benefit ratio r. By analyzing the stability of local configurations, it is found that the transitions occur at values of r at which there are changes in the ranking of the payoffs to the different local configurations of agents using different strategies. Nonmonotonic behavior of f(c)(r) at the intermediate range of r is analyzed in terms of the formation of blocks of agents using the cooperative strategy that are stabilized by agents inside the block due to the updating rule. For random initial condition with 50%-50% agents of different strategies randomly dispersed, cooperation persists in the whole range of r and the level of cooperation is higher than that in the well-mixed case in a wide range of r. These results are in sharp contrast to those based on the replicator updating rule. The sensitivity to initial states with different fractions of cooperative agents is also discussed. The results serve to illustrate that both the spatial structure and the updating rule are important in determining the level of cooperation in a competing population. When extreme initial states are used where there are very few agents of a strategy in a background of the opposite strategy, the result would depend on the stability of the clusters formed by the initially minority agents.

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.

Coexistence of cooperators and defectors in well mixed populations mediated by limiting resources

Traditionally, resource limitation in evolutionary game theory is assumed just to impose a constant population size. Here we show that resource limitations may generate dynamical payoffs able to alter an original prisoner's dilemma, and to allow for the stable coexistence between unconditional cooperators and defectors in well-mixed populations. This is a consequence of a self-organizing process that turns the interaction payoff matrix into evolutionary neutral, and represents a resource-based control mechanism preventing the spread of defectors. To our knowledge, this is the first example of coexistence in well-mixed populations with a game structure different from a snowdrift game.

Cooperation, structure, and hierarchy in multiadaptive games

Game-theoretical models where the rules of the game and the interaction structure both coevolve with the game dynamics--multiadaptive games--capture very flexible situations where cooperation among selfish agents can emerge. In this work, we will discuss a multiadaptive model presented in a recent Letter [Phys. Rev. Lett. 106, 028702 (2011)] as well as generalizations of it. The model captures a nonequilibrium situation where social unrest increases the incentive to cooperate and, simultaneously, agents are partly free to influence with whom they interact. First, we investigate the details of how feedback from the behavior of agents determines the emergence of cooperation and hierarchical contact structures. We also study the stability of the system to different types of noise, and find that different regions of parameter space show very different response. Some types of noise can destroy an all-cooperator (C) state. If, on the other hand, hubs are stable, then so is the all-C state. Finally, we investigate the dependence of the ratio between the time scales of strategy updates and the evolution of the interaction structure. We find that a comparatively fast strategy dynamics is a prerequisite for the emergence of cooperation.

Evolution of interactions and cooperation in the spatial prisoner's dilemma game

We study the evolution of cooperation in the spatial prisoner's dilemma game where players are allowed to establish new interactions with others. By employing a simple coevolutionary rule entailing only two crucial parameters, we find that different selection criteria for the new interaction partners as well as their number vitally affect the outcome of the game. The resolution of the social dilemma is most probable if the selection favors more successful players and if their maximally attainable number is restricted. While the preferential selection of the best players promotes cooperation irrespective of game parametrization, the optimal number of new interactions depends somewhat on the temptation to defect. Our findings reveal that the "making of new friends" may be an important activity for the successful evolution of cooperation, but also that partners must be selected carefully and their number limited.

Success-driven distribution of public goods promotes cooperation but preserves defection

Established already in Biblical times, the Matthew effect refers to the fact that in societies the rich tend to get richer and the potent even more powerful. Here we investigate a game theoretical model describing the evolution of cooperation on structured populations where the distribution of public goods is driven by the reproductive success of individuals. Phase diagrams reveal that cooperation is promoted irrespective of the uncertainty by strategy adoptions and the type of interaction graph, yet the complete dominance of cooperators is elusive due to the spontaneous emergence of superpersistent defectors that owe their survival to extremely rare microscopic patterns. This indicates that success-driven mechanisms are crucial for effectively harvesting benefits from collective actions but that they may also account for the observed persistence of maladaptive behavior.