Using Genetic Algorithms to Develop Strategies for the Prisoners Dilemma

Adnan Haider

MPRA Paper from University Library of Munich, Germany

Abstract: The Prisoner’s Dilemma, a simple two-person game invented by Merrill Flood & Melvin Dresher in the 1950s, has been studied extensively in Game Theory, Economics, and Political Science because it can be seen as an idealized model for real-world phenomena such as arms races (Axelrod 1984). In this paper, I describe a GA to search for strategies to play the Iterated Prisoner’s Dilemma, in which the fitness of a strategy is its average score in playing 100 games with itself and with every other member of the population. Each strategy remembers the three previous turns with a given player, by using a population of 20 strategies, fitness-proportional selection, single-point crossover with Pc=0.7, and mutation with Pm=0.001.

Keywords: GA; Crossover; Mutation and Fitness-proportional (search for similar items in EconPapers)
JEL-codes: C63 C72 (search for similar items in EconPapers)
Date: 2005-11-12, Revised 2006-04-10
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed

Published in Asian Journal of Information Technology 8.5(2006): pp. 866-871

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/28574/1/MPRA_paper_28574.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:28574

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().