Beaufils, B.; Delahaye, J.-P. & Mathieu, P.
(1998):
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma.
In: Evolutionary Programming VII,
Berlin.
[Volltext]
[Kurzfassung] [BibTeX][Endnote]
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 find an objective method to evaluate strategies for the CIPD. Finally we use the former results to add a new argument confirming that there is, in order to be good, an infinite gradient in the level of complexity in structure of strategies.
@inproceedings{beaufils98complete,
author = {Beaufils, Bruno and Delahaye, Jean-Paul and Mathieu, Philippe},
title = {Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma},
editor = {Porto, V. W. and Saravanan, N. and Waagen, D. and Eiben, A. E.},
booktitle = {Evolutionary Programming VII},
publisher = {Springer},
address = {Berlin},
year = {1998},
pages = {33--41},
url = {citeseer.ist.psu.edu/beaufils98complete.html},
keywords = {classes classical complete dilemma iterated paper prisoner read:2006},
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 find an objective method to evaluate strategies for the CIPD. Finally we use the former results to add a new argument confirming that there is, in order to be good, an infinite gradient in the level of complexity in structure of strategies.}
}
%0 = inproceedings
%A = Beaufils, Bruno and Delahaye, Jean-Paul and Mathieu, Philippe
%B = Evolutionary Programming VII
%C = Berlin
%D = 1998
%I = Springer
%T = Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma
%U = citeseer.ist.psu.edu/beaufils98complete.html
Beaufils, B.; Delahaye, J.-P. & Mathieu, P.
(1997):
Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner's Dilemma.
Erscheinungsjahr/Year: 1997.
[BibTeX]
[Endnote]
@article{omwgagsftipd,
author = {Beaufils, Bruno and Delahaye, Jean-Paul and Mathieu, Philippe},
title = {Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner's Dilemma},
year = {1997},
keywords = {dilemma good gradual iterated meeting paper prisoner read:2006 strategy}
}
%0 = article
%A = Beaufils, Bruno and Delahaye, Jean-Paul and Mathieu, Philippe
%D = 1997
%T = Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner's Dilemma