Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Cooperation in Prisoner's Dilemma on Graphs Daniel A. Ashlock
 

Summary: Cooperation in Prisoner's Dilemma on Graphs
Daniel A. Ashlock
Mathematics and Statistics
University of Guelph
Guelph, ON Canada N1G 2R4
dashlock@uoguelph.ca
Abstract
A combinatorial graph can be used to place a geography on
a population of evolving agents. In this paper agents are trained
to play Prisoner's dilemma while situated on combinatorial
graphs. A collection of thirteen different combinatorial graphs
is used. The graph always limits which agents can mate during
reproduction. Two sets of experiments are performed for each
graph: one in which agents only play prisoners dilemma against
their neighbors and one in which fitness is evaluated by a round
robin tournament among all population members. Populations
are evaluated on their level of cooperativeness, the type of play
they engage in, and by identifying the type and diversity of
strategies that are present. This latter analysis relies on the
fingerprinting of players, a representation-independent method

  

Source: Ashlock, Dan - Department of Mathematics and Statistics, University of Guelph

 

Collections: Mathematics