Please use this identifier to cite or link to this item:

Partial Imitation Rule in Iterated Prisoner Dilemma Game on a Square Lattice

Authors Wu, Degang HKUST affiliated (currently or previously)
Antony, Mathis Aurelius HKUST affiliated (currently or previously)
Szeto, Kwok Yip View this author's profile
Issue Date 2010
Source Studies in Computational Intelligence , v. 284, 2010, p. 141-150
Summary A realistic replacement of the general imitation rule in the Iterated Prisoner Dilemma (IPD) is investigated with simulation on square lattice, whereby the player, with finite memory, can only imitate those behaviors of the opponents observed in past games. In contrast to standard practice where all the possible behaviors of the opponents are accessible, the new partial imitation rule assumes that the player can at most access those behaviors of his opponent observed in the past few moves. This partial imitation of the behavior in IPD shows very different out-comes in the long time behavior of the games, such as the ranking of various strategies. In particular, the well known tit-for-tat (TFT) strategy loses its importance. © 2010 Springer-Verlag Berlin Heidelberg.
Conference Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), Granada, Spain, 12-14 May 2010
ISSN 1860-949X
ISBN 9783642125379
Rights The original publication is available at
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Scopus
View full-text via Web of Science
Files in this item:
File Description Size Format
WuAntonySzetoNICSO2010.pdf 98740 B Adobe PDF