Genetic Algorithm for Repeated Prisoner’s Dilemma
摘要
The paper deals with the repeated prisoner’s dilemma and evolving strategies for this game. For evolving strategies, an algorithm has been developed that simulates the evolution of strategies in an iterated prisoner’s dilemma, using selection, mutation and crossover operators. A new crossover operator has been developed to maximize the total population gain in the repeated prisoner’s dilemma.