We study the evolution of cooperation in the framework of evolutionary game theory, adopting the prisoner's dilemma and snowdrift game as metaphors of cooperation between unrelated individuals. In sharp contrast with previous results we find that, whenever individuals interact following networks of contacts generated via growth and preferential attachment, leading to strong correlations between individuals, cooperation becomes the dominating trait throughout the entire range of parameters of both games, as such providing a unifying framework for the emergence of cooperation. Such emergence is shown to be inhibited whenever the correlations between individuals are decreased or removed. These results are shown to apply from very large population sizes down to small communities with nearly 100 individuals.

Humans often cooperate in public goods games and situations ranging from family issues to global warming. However, evolutionary game theory predicts that the temptation to forgo the public good mostly wins over collective cooperative action, and this is often also seen in economic experiments. Here we show how social diversity provides an escape from this apparent paradox. Up to now, individuals have been treated as equivalent in all respects, in sharp contrast with real-life situations, where diversity is ubiquitous. We introduce social diversity by means of heterogeneous graphs and show that cooperation is promoted by the diversity associated with the number and size of the public goods game in which each individual participates and with the individual contribution to each such game. When social ties follow a scale-free distribution, cooperation is enhanced whenever all individuals are expected to contribute a fixed amount irrespective of the plethora of public goods games in which they engage. Our results may help to explain the emergence of cooperation in the absence of mechanisms based on individual reputation and punishment. Combining social diversity with reputation and punishment will provide instrumental clues on the self-organization of social communities and their economical implications.

Real populations have been shown to be heterogeneous, in which some individuals have many more contacts than others. This fact contrasts with the traditional homogeneous setting used in studies of evolutionary game dynamics. We incorporate heterogeneity in the population by studying games on graphs, in which the variability in connectivity ranges from single-scale graphs, for which heterogeneity is small and associated degree distributions exhibit a Gaussian tale, to scale-free graphs, for which heterogeneity is large with degree distributions exhibiting a power-law behavior. We study the evolution of cooperation, modeled in terms of the most popular dilemmas of cooperation. We show that, for all dilemmas, increasing heterogeneity favors the emergence of cooperation, such that long-term cooperative behavior easily resists short-term noncooperative behavior. Moreover, we show how cooperation depends on the intricate ties between individuals in scale-free populations.complex networks ͉ evolution of cooperation C ooperation has played a key role throughout evolution (1). Self-replicating cells have cooperated to form multicellular organisms throughout evolutionary history (2, 3). Similarly, we know that animals cooperate in families to raise their offspring and in groups to prey and to reduce the risk of predation (4, 5). Cooperation has been conveniently formulated in the framework of evolutionary game theory, which, when combined with games such as the Prisoner's Dilemma, which is used as a metaphor for studying cooperation between unrelated individuals, enables one to investigate how collective cooperative behavior may survive in a world where individual selfish actions produce better short-term results. Analytical solutions for this problem have been obtained when populations are assumed infinite and their interactions are assumed homogeneous such that all individuals are in equivalent positions. Under such assumptions, noncooperative behavior prevails. Such an unfavorable scenario for cooperation in the Prisoner's Dilemma game, together with the difficulty in ranking the actual payoffs in field and experimental work (6, 7), has lead to the adoption of other games (8, 9), such as the Snowdrift game (also known as Hawk-Dove or Chicken), which is more favorable to cooperation, and the Stag-Hunt game (10), and to numerical studies of cooperation in finite, spatially structured populations (11) in which homogeneity is still retained. Such studies of the role of structured populations have attracted considerable attention, originating from fields ranging from sociology to biology, ecology, economics, mathematics, and physics, to name a few (11)(12)(13)(14)(15)(16)(17)(18)(19). More recently, however, compelling evidence has been accumulated that a plethora of biological, social, and technological real-world networks of contacts (NoC) are mostly heterogeneous (20)(21)(22). Indeed, analysis of real-world NoC (20) has provided evidence for the following (heterogeneous) types: (i) single-scale networks, which are charac...

Conventional evolutionary game theory predicts that natural selection favours the selfish and strong even though cooperative interactions thrive at all levels of organization in living systems. Recent investigations demonstrated that a limiting factor for the evolution of cooperative interactions is the way in which they are organized, cooperators becoming evolutionarily competitive whenever individuals are constrained to interact with few others along the edges of networks with low average connectivity. Despite this insight, the conundrum of cooperation remains since recent empirical data shows that real networks exhibit typically high average connectivity and associated single-to-broad–scale heterogeneity. Here, a computational model is constructed in which individuals are able to self-organize both their strategy and their social ties throughout evolution, based exclusively on their self-interest. We show that the entangled evolution of individual strategy and network structure constitutes a key mechanism for the sustainability of cooperation in social networks. For a given average connectivity of the population, there is a critical value for the ratio W between the time scales associated with the evolution of strategy and of structure above which cooperators wipe out defectors. Moreover, the emerging social networks exhibit an overall heterogeneity that accounts very well for the diversity of patterns recently found in acquired data on social networks. Finally, heterogeneity is found to become maximal when W reaches its critical value. These results show that simple topological dynamics reflecting the individual capacity for self-organization of social ties can produce realistic networks of high average connectivity with associated single-to-broad–scale heterogeneity. On the other hand, they show that cooperation cannot evolve as a result of “social viscosity” alone in heterogeneous networks with high average connectivity, requiring the additional mechanism of topological co-evolution to ensure the survival of cooperative behaviour.

We study evolutionary game dynamics in finite populations. We analyze an evolutionary process, which we call pairwise comparison, for which we adopt the ubiquitous Fermi distribution function from statistical mechanics. The inverse temperature in this process controls the intensity of selection, leading to a unified framework for evolutionary dynamics at all intensities of selection, from random drift to imitation dynamics. We derive a simple closed formula that determines the feasibility of cooperation in finite populations, whenever cooperation is modeled in terms of any symmetric two-person game. In contrast with previous results, the present formula is valid at all intensities of selection and for any initial condition. We investigate the evolutionary dynamics of cooperators in finite populations, and study the interplay between intensity of selection and the remnants of interior fixed points in infinite populations, as a function of a given initial number of cooperators, showing how this interplay strongly affects the approach to fixation of a given trait in finite populations, leading to counterintuitive results at different intensities of selection.

We introduce a model in which individuals differ in the rate at which they seek new interactions with others, making rational decisions modeled as general symmetric two-player games. Once a link between two individuals has formed, the productivity of this link is evaluated. Links can be broken off at different rates. We provide analytic results for the limiting cases where linking dynamics is much faster than evolutionary dynamics and vice versa, and show how the individual capacity of forming new links or severing inconvenient ones maps into the problem of strategy evolution in a well-mixed population under a different game. For intermediate ranges, we investigate numerically the detailed interplay determined by these two time scales and show that the scope of validity of the analytical results extends to a much wider ratio of time scales than expected.

Recently, the frequency dependent Moran process has been introduced in order to describe evolutionary game dynamics in finite populations. Here, an alternative to this process is investigated that is based on pairwise comparison between two individuals. We follow a long tradition in the physics community and introduce a temperature (of selection) to account for stochastic effects. We calculate the fixation probabilities and fixation times for any symmetric 2 × 2 game, for any intensity of selection and any initial number of mutants. The temperature can be used to gauge continuously from neutral drift to the extreme selection intensity known as imitation dynamics. For some payoff matrices the distribution of fixation times can become so broad that the average value is no longer very meaningful.

We study the evolution of cooperation in communities described in terms of graphs, such that individuals occupy the vertices and engage in single rounds of the Prisoner's Dilemma with those individuals with whom they are connected through the edges of those graphs. We find an overwhelming dominance of cooperation whenever graphs are dynamically generated through the mechanisms of growth and preferential attachment. These mechanisms lead to the appearance of direct links between hubs, which constitute sufficient conditions to sustain cooperation. We show that cooperation dominates from large population sizes down to communities with nearly 100 individuals, even when extrinsic factors set a limit on the number of interactions that each individual may engage in.