Using the Genetic Algorithm to Generate Lisp Source Code to Solve the Prisoner's Dilemma   [GA]

by

Fujiki, C., Fujko, C. and Dickinson, J.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms (Conference proceedings), 1987, p. 236-240
Keywords:genetic algorithms
Notes:
Complete Lisp S-Expressions generated but are constrained to be a (variable length??) list of condition-action pairs, each of which is an s-expresion. These S-expressions are initially created at random and do _not_ evolve. Instead Mutation, Invert and crossover create new individuals using these existing components.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{ga:Dickinson87,
  author =       "Cory Fujiki and John Dickinson",
  title =        "Using the Genetic Algorithm to Generate Lisp Source
                 Code to Solve the Prisoner's Dilemma",
  booktitle =    "Genetic Algorithms and their Applications: Proceedings
                 of the second international conference on Genetic
                 Algorithms",
  year =         "1987",
  editor =       "John J. Grefenstette",
  pages =        "236--240",
  address =      "MIT, Cambridge, MA, USA",
  month =        "28-31 " # jul,
  organisation = "AAAI, Naval Research Laboratory, Bolt Beranek and
                 Newman, Inc",
  publisher_address = "Hillsdale, NJ, USA",
  publisher =    "Lawrence Erlbaum Associates",
  keywords =     "genetic algorithms",
  size =         "5 pages",
  notes =        "Complete Lisp S-Expressions generated but are
                 constrained to be a (variable length??) list of
                 condition-action pairs, each of which is an
                 s-expresion. These S-expressions are initially created
                 at random and do _not_ evolve. Instead Mutation, Invert
                 and crossover create new individuals using these
                 existing components.",
}