| Literature DB >> 19566237 |
Abstract
This paper presents some results on a spatial version of the iterated prisoner's dilemma in which every player imitates in any iteration the optimal strategy of its neighbors. Neighbors are defined with different degrees of random variation (initial rewiring) based on a square lattice, and optimal is defined with different degrees of memory, ranging from only the single preceding iteration up to all preceding iterations. It is concluded that memory notably stimulates cooperation in the iterated prisoner's dilemma played in ordered lattices, but it is unable to boost cooperation as the wiring network becomes highly disordered.Entities:
Year: 2009 PMID: 19566237 DOI: 10.1063/1.3106322
Source DB: PubMed Journal: Chaos ISSN: 1054-1500 Impact factor: 3.642