TY  - CONF
AU  - Beaufils, Bruno
AU  - Delahaye, Jean-Paul
AU  - Mathieu, Philippe
A2  - Porto, V. W.
A2  - Saravanan, N.
A2  - Waagen, D.
A2  - Eiben, A. E.
T1  - Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma
T2  - Evolutionary Programming VII
PB  - Springer
CY  - Berlin
PY  - 1998/
M2  - 
IS  - 
SP  - 33
EP  - 41
UR  - citeseer.ist.psu.edu/beaufils98complete.html
M3  - 
KW  - classes classical complete dilemma iterated paper prisoner read:2006
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 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.
ER  -

TY  - JOUR
AU  - Beaufils, Bruno
AU  - Delahaye, Jean-Paul
AU  - Mathieu, Philippe
T1  - Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner's Dilemma
JO  - 
PY  - 1997/
VL  - 
IS  - 
SP  - 
EP  - 
UR  - 
M3  - 
KW  - dilemma good gradual iterated meeting paper prisoner read:2006 strategy
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -