Thesis Committee Member(s)
Regis College Senior Honors Program
Thesis - Open Access
Number of Pages
Many traditional studies of the Iterated Prisoner's Dilemma Game (IPDG) focus on the optimal strategy for accumulating points against another player. Instead, this thesis 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. A few studies have already examined complexity in the IPDG. This study differs in its method, and it provides a proof for the computational universality of an IPDG CA. This thesis examines a method for creating a wide variety of deterministic rules by mapping each possible interaction to a binary number. Also, 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.
Date of Award
© Brian Nakayama
All content in this Collection is owned by and subject to the exclusive control of Regis University and the authors of the materials. It is available only for research purposes and may not be used in violation of copyright laws or for unlawful purposes. The materials may not be downloaded in whole or in part without permission of the copyright holder or as otherwise authorized in the “fair use” standards of the U.S. copyright laws and regulations.
Nakayama, Brian, "Universal Computation in the Prisoner's Dilemma Game" (2013). Student Publications. 596.