Prisoner's Dilemma on community networks
Xiaojie Chen, Feng Fu, Long Wang
Abstract
We introduce a community network model which exhibits scale-free property and study the evolutionary Prisoner's Dilemma game (PDG) on this network model. It is found that the frequency of cooperators decreases with the increment of the average degree k from the simulation results. And reducing inter-community links can promote cooperation when we keep the total links (including inner-community and inter-community links) unchanged. It is also shown that the heterogeneity of networks does not always enhance cooperation and the pattern of links among all the vertices under a given degree-distribution plays a crucial role in the dominance of cooperation in the network model.
Create a lesson
Related papers
Modelling the complex dynamics of online disinformation cascades
Guillermo Romero Moreno, Valentin Robu, Han La Poutré
A data-driven heuristic-ensemble method for behavioural inference in collective-risk dilemma experiments
Marc Sadurní, Martín F. Díaz, Josep Perelló et al.
Learning Social Influence with Unobserved Attention
William Thompson, Moyi Tian, Linh Huynh et al.
A Gauge-Invariant Clustering Coefficient for Complex-Weighted Bipartite Networks
Anjali Waghmare, Yu Tian, Renaud Lambiotte
Tracking High-Impact Researchers Through Highly Cited Tails
Hirushan Sajindra, Eoin Ó Colgáin
Breaking Behavioral Uniformity in Traffic Flow: Analytical Derivation and Numerical Verification of Optimal Cooperative Buffering
Raphael Korbmacher, Antoine Tordeux