Combination of continuous and binary strategies enhances network reciprocity in a spatial prisoner’s dilemma game

Noriyuki Kishimoto, Satoshi Kokubo and Jun Tanimoto

Chaos, Solitons & Fractals, 2013, vol. 56, issue C, 83-90

Abstract: For 2×2 games, especially the Spatial Prisoner’s Dilemma (SPD), most previous studies have presumed that players can either cooperate (C) or defect (D); this is the so-called discrete strategy. In this paper, we define the continuous-binary strategy instead of the discrete strategy. A systematic series of numerical simulations reports that the continuous-binary strategy enhances the network reciprocity for SPD. This new strategy is based on our previous finding that continuous and mixed strategies shows more robust cooperation than discrete strategy does in boundary games of Chicken and PD (BCH) and Stag Hunt and PD (BSH), respectively. It allows us to combine the advantages of continuous and mixed strategies over the usual discrete strategy into one model.

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

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077913001331
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:83-90

DOI: 10.1016/j.chaos.2013.07.009

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. ().