An intermediate number of neighbors promotes the emergence of generous tit-for-tat players on homogeneous networks

Hui Gao, Liming Pan and Zhihai Rong

Chaos, Solitons & Fractals, 2013, vol. 56, issue C, 154-159

Abstract: This paper investigates the evolution of reactive strategies (p,q) on the homogeneous regular and random networks with different network densities. Here p and q mean the probabilities to cooperate after a cooperative and defective opponent. Through the prisoner’s dilemma model, we show that the intermediate number of neighbors of both regular and random networks can promote the emergence of generous tit-for-tat (GTFT) strategy and improve the individuals’ gains. The sparse network inhibits the diffusion of the GTFT-like strategy, while the dense network promotes the spread of the defective strategy. Moreover, our investigation shows that compared with the regular ring, the individuals on the random network with proper number of neighbors can obtain higher gains, whereas the cooperative behavior is inhibited for the denser random network.

Date: 2013
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077913001483
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:56:y:2013:i:c:p:154-159

DOI: 10.1016/j.chaos.2013.07.017

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().