Universal computation in the prisoner's Dilemma game

Document Type

Conference Proceeding

Publication Date



Previous studies of the Iterated Prisoner's Dilemma Game (IPDG) focus on the optimal strategies for accumulating points against another player or the evolution of cooperation. Instead, this paper expands upon the possible complexity in interactions by using a Cellular Automaton (CA) model to simulate large numbers of players competing within a limited space. Unlike previous works, we introduce a method for creating a wide variety of deterministic rules by mapping each possible interaction to a binary number. We then prove the computational universality of the resulting IPDG CA. An analysis of the number of interactions leads to the discovery of interesting properties when allowing only enough iterations for a strategy to use its "transient" instructions. The implications of universal computation (UC) are also discussed. © 2014 Springer International Publishing Switzerland.

This document is currently not available here.