Examination of graphs in Multiple Agent Genetic Networks for Iterated Prisoner's Dilemma

Multiple Agent Genetic Networks (MAGnet) are spatially structured evolutionary algorithms which move both evolving agents as well as instances of a problem about a combinatorial graph. Previous work has examined their use on the Iterated Prisoner's Dilemma, a well known non-zero sum game, in order for classification of agent types based on behaviours. Only a small complete graph was examined. In this study, a larger set of graphs with thirty-two nodes are examined. The graphs examined are: a cycle graph, two Peterson graphs with differing internal rings, a hypercube in five dimensions, and the complete graph. These graphs and properties are examined for a number of canonical agents, as well as a few interesting types which involve handshaking. It was found that the MAGnet system produces a similar classification as the smaller graph when the connectivity within the graph is high. Lower graph connectivity leads to a process by which disjoint subgraphs can be formed; this is based on the method of evolution causing a subpopulation collapse in which the number of problems on a node tends to zero and the node is removed.

[1]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[2]  D. E. Matthews.  Evolution and the Theory of Games , 1977 .

[3]  W. Hamilton,et al.  The evolution of cooperation. , 1984, Science.

[4]  David B. Fogel,et al.  Evolving Behaviors in the Iterated Prisoner's Dilemma , 1993, Evolutionary Computation.

[5]  M. Hemesath.  Cooperate or Defect? Russian and American Students in a Prisoner's Dilemma , 1994 .

[6]  David B. Fogel,et al.  On the Relationship between the Duration of an Encounter and the Evolution of Cooperation in the Iterated Prisoner's Dilemma , 1995, Evolutionary Computation.

[7]  Edgar G. Goodaire,et al.  Discrete Mathematics With Graph Theory , 1997 .

[8]  D. Fogel,et al.  On the instability of evolutionary stable strategies. , 1997, Bio Systems.

[9]  M. Nowak,et al.  Evolutionary game theory , 1995, Current Biology.

[10]  Jordan B. Pollack,et al.  Effects of Finite Populations on Evolutionary Stable Strategies , 2000, GECCO.

[11]  D. Roy.  Learning and the theory of games. , 2000, Journal of theoretical biology.

[12]  Winfried Lamersdorf,et al.  Genetic algorithms for automated negotiations: a FSM-based application approach , 2000, Proceedings 11th International Workshop on Database and Expert Systems Applications.

[13]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[14]  E. G. Goodaire,et al.  Discrete Mathematics with Graph Theory, 3rd Edition , 2005 .

[15]  R. Polikar,et al.  Ensemble based systems in decision making , 2006, IEEE Circuits and Systems Magazine.

[16]  Daniel A. Ashlock,et al.  Changes in Prisoner’s Dilemma Strategies Over Evolutionary Time With Different Population Sizes , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[17]  Eun-Youn Kim,et al.  Understanding representational sensitivity in the iterated prisoner's dilemma with fingerprints , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[18]  Daniel A. Ashlock,et al.  Graph-based evolutionary algorithms , 2006, IEEE Transactions on Evolutionary Computation.

[19]  Wendy Ashlock,et al.  Why Some Representations Are More Cooperative Than Others For Prisoner's Dilemma , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[20]  Daniel A. Ashlock,et al.  Cooperation in Prisoner's Dilemma on Graphs , 2007, 2007 IEEE Symposium on Computational Intelligence and Games.

[21]  Daniel A. Ashlock,et al.  Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies , 2008, IEEE Transactions on Evolutionary Computation.

[22]  Daniel A. Ashlock,et al.  A fingerprint comparison of different Prisoner's Dilemma payoff matrices , 2010, Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games.

[23]  Nelson F. F. Ebecken,et al.  Coevolutionary multi-population genetic programming for data classification , 2010, GECCO '10.

[24]  Daniel A. Ashlock,et al.  Domination in Iterated Prisoner's Dilemma , 2011, 2011 24th Canadian Conference on Electrical and Computer Engineering(CCECE).

[25]  Graham Kendall,et al.  Engineering Design of Strategies for Winning Iterated Prisoner's Dilemma Competitions , 2011, IEEE Transactions on Computational Intelligence and AI in Games.

[26]  Hisao Ishibuchi,et al.  Evolution of Strategies With Different Representation Schemes in a Spatial Iterated Prisoner's Dilemma Game , 2011, IEEE Transactions on Computational Intelligence and AI in Games.

[27]  Joseph Alexander Brown,et al.  Multiple Agent Genetic Networks for Iterated Prisoner's Dilemma , 2011, 2011 IEEE Symposium on Foundations of Computational Intelligence (FOCI).

[28]  Seán G. Brady,et al.  Symbiont fidelity and the origin of species in fungus-growing ants , 2012, Nature Communications.

[29]  Raymond Chiong,et al.  Effects of Iterated Interactions in Multiplayer Spatial Evolutionary Games , 2012, IEEE Transactions on Evolutionary Computation.

[30]  Daniel A. Ashlock,et al.  Agent-Case Embeddings for the Analysis of Evolved Systems , 2013, IEEE Transactions on Evolutionary Computation.