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

Autor:	Satoshi Kokubo, Jun Tanimoto, Noriyuki Kishimoto
Rok vydání:	2013
Předmět:	Mathematical optimization Series (mathematics) General Mathematics Applied Mathematics General Physics and Astronomy Boundary (topology) Statistical and Nonlinear Physics Prisoner's dilemma Dilemma Stag hunt Best response Reciprocity (network science) BCH code Mathematics
Zdroj:	Chaos, Solitons & Fractals. 56:83-90
ISSN:	0960-0779
DOI:	10.1016/j.chaos.2013.07.009
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::790b83dcaa2f36fc67e86b15b1fd0a88 https://doi.org/10.1016/j.chaos.2013.07.009 Zobrazit plný text záznamu Full Text from ScienceDirect