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

Evolution of grim trigger in prisoner dilemma game with partial imitation

Authors Wu, Degang HKUST affiliated (currently or previously)
Antony, Mathis
Szeto, Kwok Yip View this author's profile
Issue Date 2010
Source EvoStar 2010, Lecture Notes in Computer Science, Istanbul Technical University, Istanbui, Turkey , v. 6024, (PART 1), 2010, p. 151-160
Summary The emergence of Grim Trigger as the dominant strategy in the Iterated Prisoner Dilemma (IPD) on a square lattice is investigated for players with finite memory, using three different kinds of imitation rule: the traditional imitation rule where the entire data base of the opponent's moves is copied, and the two more realistic partial imitation rules that copy only a subset of opponent's moves based on information of games played. We find that the dominance of Grim Trigger is enhanced at the expense of some well known strategies such as tit-for-tat (TFT) when a player has access only to those moves observed in past games played with his opponents. The evolution of the clusters of Grim Trigger in the early stage of the games obeys a common pattern for all imitation rules, before these clusters of Grim Triggers coalesce into larger patches in the square lattice. A physical explanation for this pattern evolution is given. Implication of the partial imitation rule for IPD on complex networks is discussed. © 2010 Springer-Verlag Berlin Heidelberg.
ISSN 0302-9743
ISBN 978-3-642-12238-5
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
WuAntonySzeto2010Evostar20091130.pdf 1430042 B Adobe PDF