<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/cschenk/classical"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/cschenk/classical</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/228964e4e1c807a3a838723e8b2f8d3be/cschenk"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/228964e4e1c807a3a838723e8b2f8d3be/cschenk"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="/brokenurl#citeseer.ist.psu.edu/beaufils98complete.html"/><swrc:date>Tue Jun 03 14:24:13 CEST 2008</swrc:date><swrc:address>Berlin</swrc:address><swrc:booktitle>Evolutionary {P}rogramming {VII}</swrc:booktitle><swrc:pages>33--41</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:title>Complete Classes of Strategies for the Classical Iterated Prisoner&#039;s Dilemma</swrc:title><swrc:year>1998</swrc:year><swrc:keywords>classes classical complete dilemma iterated paper prisoner read:2006 </swrc:keywords><swrc: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.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Bruno Beaufils"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Jean-Paul Delahaye"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Philippe Mathieu"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="V. W. Porto"/></rdf:_1><rdf:_2><swrc:Person swrc:name="N. Saravanan"/></rdf:_2><rdf:_3><swrc:Person swrc:name="D. Waagen"/></rdf:_3><rdf:_4><swrc:Person swrc:name="A. E. Eiben"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description></rdf:RDF>
