BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:cschenk

The blue social bookmark and publication sharing system.

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma

by: Bruno Beaufils, Jean-Paul Delahaye, and Philippe Mathieu

In: Evolutionary Programming VII Berlin: Springer (1998) , p. 33--41.

Resources (URL, PDF, PS...)

URL:	citeseer.ist.psu.edu/beaufils98complete.html

The Classical Iterated Prisoner’s Dilemma CIPD is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to generate automatically a great numbers of strategies. Then we show some results of ecological evolution on those strategies, with the description of the experimentations we have made. Our main purpose is to ﬁnd an objective method to evaluate strategies for the CIPD. Finally we use the former results to add a new argument conﬁrming that there is, in order to be good, an inﬁnite gradient in the level of complexity in structure of strategies.

BibTeX record

@inproceedings{beaufils98complete,
  abstract = {The Classical Iterated Prisoner’s Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to generate automatically a great numbers of strategies. Then we show some results of ecological evolution on those strategies, with the description of the experimentations we have made. Our main purpose is to ﬁnd an objective method to evaluate strategies for the CIPD. Finally we use the former results to add a new argument conﬁrming that there is, in order to be good, an inﬁnite gradient in the level of complexity in structure of strategies.},
  added-at = {2008-06-03T14:24:13.000+0200},
  address = {Berlin},
  author = {Beaufils, Bruno and Delahaye, Jean-Paul and Mathieu, Philippe},
  biburl = {http://www.bibsonomy.org/bibtex/228964e4e1c807a3a838723e8b2f8d3be/cschenk},
  booktitle = {Evolutionary {P}rogramming {VII}},
  editor = {Porto, V. W. and Saravanan, N. and Waagen, D. and Eiben, A. E.},
  interhash = {b8af98d221e972064132d89aa4899db6},
  intrahash = {28964e4e1c807a3a838723e8b2f8d3be},
  keywords = {classes classical complete dilemma iterated paper prisoner read:2006},
  pages = {33--41},
  publisher = {Springer},
  timestamp = {2008-06-03T14:24:13.000+0200},
  title = {Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma},
  url = {citeseer.ist.psu.edu/beaufils98complete.html},
  year = 1998
}

Endnote record

BibSonomy :: publication ::

Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma

Resources (URL, PDF, PS...)

Abstract

BibTeX record

Endnote record