Main content

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

Show simple item record

dc.contributor.advisor Ashlock, Daniel von Keitz, Michael 2011-12-21T21:42:44Z 2011-12-21T21:42:44Z 2011-12 2011-09-06 2011-12-21
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.subject Iterated Prisoner's Dilemma en_US
dc.subject Prisoner's Dilemma en_US
dc.subject Burnside's Lemma en_US
dc.subject Linear boundaries en_US
dc.subject Normalized Space en_US
dc.subject Diversity en_US
dc.subject Shannon Entropy en_US
dc.subject Payoff Matrices en_US
dc.subject Game Theory en_US
dc.title A Search for Maximal Diversity Amongst Paired Prisoner's Dilemma Strategies en_US
dc.type Thesis en_US Mathematics and Statistics en_US Master of Science en_US Department of Mathematics and Statistics en_US

Files in this item

Files Size Format View
Michael_von_Keitz_Thesis_ReResubmit.pdf 3.546Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record