Return to search

A Search for Maximal Diversity Amongst Paired Prisoner's Dilemma Strategies

Previous research has identified linear boundaries within a normalized unit square for specific paired strategies within the iterated prisoner's dilemma schema. In this work, general methods of capturing linear boundaries are developed and demonstrated on a wider variety of paired strategies. The method is also tested using an alternate scoring method. An application of Burnside's Lemma simplifies the number of neighbourhood configurations to be considered. In addition, Shannon entropy is used as a means of evaluating diversity of agents evolved with different payoff matrices, by which one might locate a game that is as balanced as possible.

Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OGU.10214/3210
Date21 December 2011
Creatorsvon Keitz, Michael
ContributorsAshlock, Daniel
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish
Detected LanguageEnglish
TypeThesis

Page generated in 0.0016 seconds