Social Trends in the Iterated Prisoner’s Dilemma (Extended Abstract)
Published in Genetic and Evolutionary Computation Conference (GECCO) 2017, 2017
Abstract: In this paper, we utilize a multi-objective genetic algorithm (GA) to investigate the Iterated Prisoner’s Dilemma problem with a population of players that don’t have uniform objectives. Each of the members of our population has one of four objective pairs. We simulate a tournament similar to those in previous work to investigate patterns of convergence in objective pairs when they are free to change. We also consider the most successful objective pair within a population when members’ objective pairs are fixed.