Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!news.starnet.net!wupost!nic.smsu.edu!newsdist.tc.umn.edu!umn.edu!news
From: "James Albert Larson" <larso171@maroon.tc.umn.edu>
Subject: Re: Prisoner's dilemma and GAs
To: ray@falcon.cc.ukans.edu
Message-ID: <23709.larso171@maroon.tc.umn.edu>
X-Minuet-Version: Minuet1.0_Beta_16
Sender: news@news.cis.umn.edu (Usenet News Administration)
Nntp-Posting-Host: dialup-2-153.gw.umn.edu
X-Popmail-Charset: English
Organization: University of Minnesota, Twin Cities
Date: Sun, 28 May 1995 08:08:35 GMT
Lines: 10

Ray,

Goldberg's 1989 book, "Genetic Algorithms in Search, Optimization, and 
Machine Learning" (p. 140-142) and 1994 Michalewicz's book, "Genetic 
Algorithms + Data Structures = Evolution Programs" (p. 22 f) both describe 
Axelrod's study of using GA to evolve solutions to the prisoner's dilemma 
problem that beat tit for tat.

Jim Larson

