TY  - JOUR
T1  - Using Genetic Algorithms to Develop Strategies For Prisoner’S Dilemma
AU - , Syed Adnan Haider AU - , Ali Shah Bukhari 
JO  - Asian Journal of Information Technology
VL  - 5
IS  - 8
SP  - 866
EP  - 871
PY  - 2006
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2006.866.871
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2006.866.871
KW  - Genetic algorithms
KW  -crossover
KW  -mutation and fitness-proportional
AB  - 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.
ER  -