Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
The Prisoner`s Dilemma, a simple two-person game invented by Merrill Flood and 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 thisstudy, 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.
How to cite this article:
Syed Adnan Haider and Ali Shah Bukhari . Using Genetic Algorithms to Develop Strategies For Prisoner’S Dilemma.
DOI: https://doi.org/10.36478/ajit.2006.866.871
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2006.866.871