Dynamical organization of cooperation in complex topologies.

By Jesús Gómez-Gardeñes, M. Campillo, Luis Mario Floría, Yamir Moreno. Physical Review Letters, 2006

473 citations recorded by the source corpus.

In this Letter, we study how cooperation is organized in complex topologies by analyzing the evolutionary (replicator) dynamics of the prisoner's dilemma, a two-player game with two available strategies, defection and cooperation, whose payoff matrix favors defection. We show that, asymptotically, the population is partitioned into three subsets: individuals that always cooperate (pure cooperators), always defect (pure defectors), and those that intermittently change their strategy. In fact, the size of the later set is the biggest for a wide range of the "stimulus to defect" parameter. While in homogeneous random graphs pure cooperators are grouped into several clusters, in heterogeneous scale-free (SF) networks they always form a single cluster containing the most connected individuals (hubs). Our results give further insights into why cooperation in SF networks is enhanced.

Subfields: Genetics, Sociology and Political Science, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/7cbafa1cdc5ae050d8a9217ea6e7db209dac67b7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Genetics

In Sociology and Political Science

In Statistical and Nonlinear Physics

Citations in the corpus

Games on graphs (2014, background): “Exact analysis is difficult beyond simple cases such as the star graph [11], [35], but extensive simulation results are available [84], [28], [95, 7], [78], [120].”
Coevolutionary games - A mini review (2009, background): “…several studies have since elaborated on different aspects of cooperation on scale-free networks, as for example its dynamical organization (Gómez-Gardeñes et al., 2007; Pusch et al., 2008), evolution under clustering (Assenza et al., 2008), mixing patterns (Rong et al., 2007), memory…”
Structure and Dynamics of Networks (2009, background): “Recent studies [Gomez-Gardenes et al., 2007a] on Barabási-Albert networks, which have a scale-free degree distribution, γ = 3, and particular further properties due to their construction scheme, revealed a dominance of the cooperation strategy, a behavior previously unobserved.”
Multilayer Analysis and Visualization of Networks (2014, background): “Such efforts have yielded numerous insights in many areas of science and technology [2–16].”
Networks beyond pairwise interactions: structure and dynamics (2020, background): “Graphs which are heavy-tailed [538, 539] or clustered [540] provide the best conditions for”