A Representational Sensitivity Study of Game Theoretic Simulations
with Nicole Leahy and Bruce Wagner
Submitted to CEC 2000

Abstract PDF eprint

A number of papers using evolutionary algorithms to do studies of the iterated prisoner's dilemma have been published. Typically a single representation or small group of closely related representations were used to store the strategies for playing the iterated prisoner's dilemma. In this paper we present the results of a study of the sensitivity of a very simple evolutionary algorithm, studying the emergence of cooperation, to change of the representation of the prisoner's dilemma strategy. We find strong dependence of behavior on the choice of representation with the level of cooperation varying from 0% to in excess of 90% for different representations.