| Summary: | 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.
|
|---|
