<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/user/cschenk/dilemma"><title>BibSonomy publications for /user/cschenk/dilemma</title><link>BibSonomypublrss/user/cschenk/dilemma</link><description>BibSonomy RSS feed for /user/cschenk/dilemma</description><dc:date>2012-02-16T12:52:12+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/286d9087c7c7e695d2f2079e658526480/cschenk"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/228964e4e1c807a3a838723e8b2f8d3be/cschenk"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/286d9087c7c7e695d2f2079e658526480/cschenk"><title>Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner&#039;s Dilemma</title><link>http://www.bibsonomy.org/bibtex/286d9087c7c7e695d2f2079e658526480/cschenk</link><dc:creator>cschenk</dc:creator><dc:date>2008-06-03T14:25:48+02:00</dc:date><dc:subject>dilemma good gradual iterated meeting paper prisoner read:2006 strategy </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Beaufils&#034;&gt;Bruno Beaufils&lt;/a&gt;, &lt;a href=&#034;/author/Delahaye&#034;&gt;Jean-Paul Delahaye&lt;/a&gt;,  and &lt;a href=&#034;/author/Mathieu&#034;&gt;Philippe Mathieu&lt;/a&gt; &lt;/span&gt;  (&lt;em&gt;1997&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dilemma"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/good"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/gradual"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/iterated"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/meeting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/paper"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prisoner"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/read:2006"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/strategy"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/228964e4e1c807a3a838723e8b2f8d3be/cschenk"><title>Complete Classes of Strategies for the Classical Iterated Prisoner&#039;s Dilemma</title><link>http://www.bibsonomy.org/bibtex/228964e4e1c807a3a838723e8b2f8d3be/cschenk</link><dc:creator>cschenk</dc:creator><dc:date>2008-06-03T14:24:13+02:00</dc:date><dc:subject>classes classical complete dilemma iterated paper prisoner read:2006 </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Beaufils&#034;&gt;Bruno Beaufils&lt;/a&gt;, &lt;a href=&#034;/author/Delahaye&#034;&gt;Jean-Paul Delahaye&lt;/a&gt;,  and &lt;a href=&#034;/author/Mathieu&#034;&gt;Philippe Mathieu&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Evolutionary Programming VII, &lt;/em&gt;&lt;em&gt;page 33--41. &lt;/em&gt;&lt;em&gt;Berlin, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classes"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classical"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complete"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dilemma"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/iterated"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/paper"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prisoner"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/read:2006"/></rdf:Bag></taxo:topics></item></rdf:RDF>
