Roles of mixing patterns in cooperation on a scale-free networked game

Zhihai Rong, Xiang Li, and Xiaofan Wang
Phys. Rev. E 76, 027101 – Published 8 August 2007

Abstract

We investigate how the degree-mixing pattern affects the emergence of cooperation in the networked prisoner’s dilemma game. Our study shows that when a network becomes assortative mixing by degree, the large-degree vertices (hubs) tend to interconnect to each other closely, which destroys the sustainability among cooperators and promotes the invasion of defectors, whereas in disassortative networks, the isolation among hubs protects the cooperative hubs in holding onto their initial strategies to avoid extinction.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 27 May 2007

DOI:https://doi.org/10.1103/PhysRevE.76.027101

©2007 American Physical Society

Authors & Affiliations

Zhihai Rong, Xiang Li*, and Xiaofan Wang

  • Complex Networks and Control Lab, Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, China

  • *xli@sjtu.edu.cn

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 76, Iss. 2 — August 2007

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×