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.

Topics
Dynamical systems, Selection rule, Game theory, Genomics
1.
M. A.
 
Nowak
 and
R. M.
 
May
,
Nature (London)
https://doi.org/10.1038/359826a0
 
359
,
826
(
1992
).
Google Scholar
Crossref
Search ADS
 
2.
M. A.
 
Nowak
 and
R. M.
 
May
,
Int. J. Bifurcation Chaos Appl. Sci. Eng.
 
3
,
35
(
1993
).
https://doi.org/10.1142/S0218127493000040
Google Scholar
Crossref
Search ADS
 
3.
R.
 
Axelrod
,
The Evolution of Cooperation
, revised ed. (
Basic
,
New York
,
2008
).
Google Scholar
 
4.
This geometric memory mechanism is accumulative in its demand for knowledge of past history: the whole {pi,j(t)} and {di,j(t)} series need not be known to calculate πi,j(T)⁠, the memory charge ωi,j(T)⁠, and the numerator of mi,j(T)⁠, while it suffices to sequentially compute πi,j(T)=απi,j(T−1)+pi,j(T) and ωi,j(T)=αωi,j(T−1)+di,j(T)⁠.
5.
R.
 
Alonso-Sanz
, in
Encyclopedia of Complexity and System Sciences
, edited by
B.
 
Meyer
 (
Springer
,
New York
, in press), and references therein.
6.
K.
 
Lindgren
 and
M. G.
 
Nordahl
,
Physica D
https://doi.org/10.1016/0167-2789(94)90289-5
 
75
,
292
(
1994
).
Google Scholar
Crossref
Search ADS
 
7.
K.
 
Lindgren
 and
M. G.
 
Nordahl
, in
Artificial Life
, edited by
C.
 
Langton
 (
The MIT Press
,
Cambridge
,
1995
), pp.
16
–
37
.
Google Scholar
 
8.
We have explored the effect of embedded memory when the players are not spatially structured in Ref. 16. This paper deals with the Paulov strategy, a robust strategy was also successful in the probabilistic simulations with genome-type memory in Ref. 17.
9.
Thus the last pattern shown in Fig. 6 appears almost stabilized, whereas that of Fig. 5 shows many players in the border of the cooperation aggregates turning cooperators (green color).
10.
R.
 
Alonso-Sanz
 and
M.
 
Martin
,
Int. J. Mod. Phys. C
 
17
,
841
(
2006
).
https://doi.org/10.1142/S012918310600928X
Google Scholar
Crossref
Search ADS
 
11.
R.
 
Alonso-Sanz
,
M. C.
 
Martin
, and
M.
 
Martin
,
Int. J. Bifurcation Chaos Appl. Sci. Eng.
 
11
,
2061
(
2001
), and references therein.
https://doi.org/10.1142/S0218127401003383
Google Scholar
Crossref
Search ADS
 
12.
D. J.
 
Watts
 and
S. H.
 
Strogatz
,
Nature (London)
https://doi.org/10.1038/30918
 
393
,
440
(
1998
).
Google Scholar
Crossref
Search ADS
 
13.
Albeit a static wiring network. In the structurally dynamic cellular automata studied with memory in Ref. 18, the connections between cells are allowed to change according to rules similar in nature to the state transition rules in conventional cellular automata.
14.
G.
 
Szabo
 and
G.
 
Fáth
,
Phys. Rep.
https://doi.org/10.1016/j.physrep.2007.04.004
 
446
,
97
(
2007
).
Google Scholar
Crossref
Search ADS
 
15.
R.
 
Alonso-Sanz
, “
Memory boosts cooperation in the structurally dynamic prisoner's dilemma
,”
Int. J. Bifurcation Chaos Appl. Sci. Eng.
(in press).
16.
R.
 
Alonso-Sanz
,
Int. J. Bifurcation Chaos Appl. Sci. Eng.
 
15
,
3395
(
2005
).
https://doi.org/10.1142/S0218127405013952
Google Scholar
Crossref
Search ADS
 
17.
C.
 
Hauert
 and
H. G.
 
Schuster
,
Proc. R. Soc. London, Ser. B
https://doi.org/10.1098/rspb.1997.0073
 
264
,
513
(
1997
).
Google Scholar
Crossref
Search ADS
 
18.
R.
 
Alonso-Sanz
,
Chaos, Solitons Fractals
 
32
,
1285
(
2007
).
https://doi.org/10.1016/j.chaos.2005.12.047
Google Scholar
Crossref
Search ADS
 
© 2009 American Institute of Physics.
2009
American Institute of Physics
You do not currently have access to this content.