Partial imitation rule in Iterated Prisoner Dilemma game on a square lattice

2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Wu, D., Antony, M., & Szeto, K. Y. (2010). Partial imitation rule in Iterated Prisoner Dilemma game on a square lattice. In Studies in Computational Intelligence (Vol. 284, pp. 141–150). https://doi.org/10.1007/978-3-642-12538-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free