<?xml version="1.0"?>
<!DOCTYPE dblp SYSTEM "http://www.informatik.uni-trier.de/~ley/db/about/dblp.dtd">
<!-- This file was exported from BibSonomy, http://www.bibsonomy.org -->

<dblp><inproceedings mdate="1998" key="beaufils98complete">
       <author>Beaufils&#44; Bruno</author>
<author>Delahaye&#44; Jean&#45;Paul</author>
<author>Mathieu&#44; Philippe</author> 
    <editor>Porto&#44; V. W. and Saravanan&#44; N. and Waagen&#44; D. and Eiben&#44; A. E.</editor>
    <address>Berlin</address>

    <title>Complete Classes of Strategies for the Classical Iterated Prisoner&#39;s Dilemma</title>
    <booktitle>Evolutionary Programming VII</booktitle>
    <pages>33&#x2013;41</pages>
    <year>1998</year>




    <url>citeseer.ist.psu.edu/beaufils98complete.html</url>

    <publisher>Springer</publisher>







</inproceedings>
 



<article mdate="1997" key="omwgagsftipd">
       <author>Beaufils&#44; Bruno</author>
<author>Delahaye&#44; Jean&#45;Paul</author>
<author>Mathieu&#44; Philippe</author> 



    <title>Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner&#39;s Dilemma</title>


    <year>1997</year>














</article>
 



</dblp>

