Main content

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

Show full item record

Title: A Search for Maximal Diversity Amongst Paired Prisoner's Dilemma Strategies
Author: von Keitz, Michael
Department: Department of Mathematics and Statistics
Program: Mathematics and Statistics
Advisor: Ashlock, Daniel
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.
URI: http://hdl.handle.net/10214/3210
Date: 2011-12
Terms of Use: All items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.


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 full item record