2018
DOI: 10.1073/pnas.1715357115
|View full text |Cite
|
Sign up to set email alerts
|

Cooperation, clustering, and assortative mixing in dynamic networks

Abstract: Humans' propensity to cooperate is driven by our embeddedness in social networks. A key mechanism through which networks promote cooperation is clustering. Within clusters, conditional cooperators are insulated from exploitation by noncooperators, allowing them to reap the benefits of cooperation. Dynamic networks, where ties can be shed and new ties formed, allow for the endogenous emergence of clusters of cooperators. Although past work suggests that either reputation processes or network dynamics can increa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

6
68
0
2

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 57 publications
(76 citation statements)
references
References 43 publications
6
68
0
2
Order By: Relevance
“…In this regard, the continuous prisoner's dilemma has been proposed as a representative model able to account for different levels of cooperation 3,32,33 .Moreover, the presence of graphs of connections among players is typical for real populations, where asymmetric relationships are frequently observed. The evolution of strategies on graphs has been investigated in several studies [34][35][36][37][38][39][40][41][42] . Among them, the replicator equation on regular infinite graphs, embedding network reciprocity, has been developed and analyzed in 15,43,44 .…”
mentioning
confidence: 99%
“…In this regard, the continuous prisoner's dilemma has been proposed as a representative model able to account for different levels of cooperation 3,32,33 .Moreover, the presence of graphs of connections among players is typical for real populations, where asymmetric relationships are frequently observed. The evolution of strategies on graphs has been investigated in several studies [34][35][36][37][38][39][40][41][42] . Among them, the replicator equation on regular infinite graphs, embedding network reciprocity, has been developed and analyzed in 15,43,44 .…”
mentioning
confidence: 99%
“…First, before even testing an experimental dataset against a candidate process of strategy update, we must be able to distinguish the cooperative from the defective mood of the subjects, if any mood really does exist. This distinction is not completely clear from the available experiments, in which C and D were the only options and, except the experiment described in [62] about evolving networks, subjects had to chose whether to play C or D with all neighbors at each game round. Consequently, risk-avoiding defections can be easily confused for a defective mood.…”
Section: Impact On Applied Behavioral Sciencementioning
confidence: 99%
“…It is therefore important, in our opinion, to allow the subjects to act independently with their neighbors and to abstain from playing with selected ones. For example, allowing independent actions for each neighbor has been recently shown to favor cooperation [62], although it is definitely experimentally challenging. Subjects playing C or abstaining with most neighbors could be classified in the cooperative mood; subjects mainly playing D in a defective mood; and a mix of C and D would indicate the absence of a mood.…”
Section: Impact On Applied Behavioral Sciencementioning
confidence: 99%
See 1 more Smart Citation
“…As redes podem promover a cooperação quando sua topologia existente ou emergente permite que cooperadores condicionais na rede se isolem da exploração por nãocooperadores. As redes dinâmicas geram taxas muito altas de cooperação, mesmo sem conhecimento de reputação (MELAMED et al, 2018).…”
Section: Redes De Cooperaçãounclassified