Modelling exchange using the prisoner's dilemma and genetic programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8028
- @InProceedings{GPandIPDpaper1999Hirsch,
-
author = "Laurence Hirsch and Masoud Saeedi",
-
title = "Modelling exchange using the prisoner's dilemma and
genetic programming",
-
booktitle = "Proceedings of the Computer Society of Iran Computing
Conference",
-
year = "1999",
-
editor = "Rasool Jalili",
-
address = "Sharif University of Technology, Tehran, Iran",
-
month = "26-28 " # jan,
-
keywords = "genetic algorithms, genetic programming",
-
URL = "http://shura.shu.ac.uk/id/eprint/3809",
-
URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/GPandIPDpaper1999Hirsch.pdf",
-
size = "8 pages",
-
abstract = "In this paper we show how exchange, co-operation and
other complex strategies found in nature can be
modelled using the prisoners dilemma game and genetic
programming. We are able to produce and evolve
different strategies represented by computer programs
that can play the prisoners' dilemma against a set of
predefined strategies or against other programs in the
population (co-evolution). Although the game is simple
the number of possible strategies for playing it is
huge. Genetic programming provides an efficient search
mechanism capable of identifying and propagating
strategies that do well in a particular environment.
Our implementation provides a distinct advantage over
previous investigations into the prisoner's dilemma
using genetic algorithms. In particular strategies can
be based upon the entire history of a game at any
point, rather than on recent moves only. We incorporate
the use of list data structures as terminals and
provide list-searching capability in the function set
so that potentially large volumes of data can be used
by the evolved programs.",
-
notes = "CSICC 98 http://persia.org/Conferences/conf3/cp.html",
- }
Genetic Programming entries for
Laurence Hirsch
Masoud Saeedi
Citations