Exploring the Effect of Proximity and Kinship on Mutual Cooperation in the Iterated Prisoner’s Dilemma
The iterated prisoner’s dilemma (IPD) has been used as a model for investigating cooperation in nature. Here, we present an analysis of the evolution of reciprocal cooperation in a dynamically simulated environment in which individual agents are free to move in space, interacting with their nearest...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 710 |
|---|---|
| container_issue | |
| container_start_page | 701 |
| container_title | |
| container_volume | |
| creator | Frayn, Colin Pryke, Andy Chong, Siang Yew |
| description | The iterated prisoner’s dilemma (IPD) has been used as a model for investigating cooperation in nature. Here, we present an analysis of the evolution of reciprocal cooperation in a dynamically simulated environment in which individual agents are free to move in space, interacting with their nearest neighbors in fixed-length IPD games. Agents aim to avoid those against whom they score poorly, and to seek out those against whom they score highly. Individuals are modeled using finite state machines, allowing us to extend previous work on kin group markers. Though they have no direct effect on an individual’s strategy, such markers do lead to the emergence of coherent, mutually-cooperating sub-populations. |
| doi_str_mv | 10.1007/11844297_71 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19687250</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19687250</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-1d66e50292396b83a773c6e185f7e3186873a047357de22b38814d2508e064763</originalsourceid><addsrcrecordid>eNpNkE1OwzAUhM2fRFu64gLesGAR8LMd_yxRKVBRBAtYR27iUEMSR3YqtTuuwfU4CSkFidWT5n0z0gxCp0AugBB5CaA4p1pmEvbQkKWcMKU1wD4agABIGOP6AI21VH8_wg7RgDBCEy05O0bDGN8IIVRqOkDL6bqtfHDNK-6WFk_L0uYd9iV-Cn7tatdtsGkKfO-auHQt9g1-WHUrU-GJ960NpnO95Jof86zbCrbovS76xoavj8-Ir11l69qcoKPSVNGOf-8IvdxMnyd3yfzxdja5mictBd0lUAhhU0I1ZVosFDNSslxYUGkpLQMllGSGcMlSWVhKF0wp4AVNibJEcCnYCJ3tclsTc1OVwTS5i1kbXG3CJgPdJ_R4z53vuNhu29uQLbx_jxmQbLtz9m9n9g25fmpa</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Exploring the Effect of Proximity and Kinship on Mutual Cooperation in the Iterated Prisoner’s Dilemma</title><source>Springer Books</source><creator>Frayn, Colin ; Pryke, Andy ; Chong, Siang Yew</creator><contributor>Yao, Xin ; Whitley, L. Darrell ; Merelo-Guervós, Juan J. ; Runarsson, Thomas Philip ; Burke, Edmund ; Beyer, Hans-Georg</contributor><creatorcontrib>Frayn, Colin ; Pryke, Andy ; Chong, Siang Yew ; Yao, Xin ; Whitley, L. Darrell ; Merelo-Guervós, Juan J. ; Runarsson, Thomas Philip ; Burke, Edmund ; Beyer, Hans-Georg</creatorcontrib><description>The iterated prisoner’s dilemma (IPD) has been used as a model for investigating cooperation in nature. Here, we present an analysis of the evolution of reciprocal cooperation in a dynamically simulated environment in which individual agents are free to move in space, interacting with their nearest neighbors in fixed-length IPD games. Agents aim to avoid those against whom they score poorly, and to seek out those against whom they score highly. Individuals are modeled using finite state machines, allowing us to extend previous work on kin group markers. Though they have no direct effect on an individual’s strategy, such markers do lead to the emergence of coherent, mutually-cooperating sub-populations.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540389903</identifier><identifier>ISBN: 3540389903</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540389911</identifier><identifier>EISBN: 9783540389910</identifier><identifier>DOI: 10.1007/11844297_71</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Software ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2006, p.701-710</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11844297_71$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11844297_71$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27930,38260,41447,42516</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19687250$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Yao, Xin</contributor><contributor>Whitley, L. Darrell</contributor><contributor>Merelo-Guervós, Juan J.</contributor><contributor>Runarsson, Thomas Philip</contributor><contributor>Burke, Edmund</contributor><contributor>Beyer, Hans-Georg</contributor><creatorcontrib>Frayn, Colin</creatorcontrib><creatorcontrib>Pryke, Andy</creatorcontrib><creatorcontrib>Chong, Siang Yew</creatorcontrib><title>Exploring the Effect of Proximity and Kinship on Mutual Cooperation in the Iterated Prisoner’s Dilemma</title><title>Lecture notes in computer science</title><description>The iterated prisoner’s dilemma (IPD) has been used as a model for investigating cooperation in nature. Here, we present an analysis of the evolution of reciprocal cooperation in a dynamically simulated environment in which individual agents are free to move in space, interacting with their nearest neighbors in fixed-length IPD games. Agents aim to avoid those against whom they score poorly, and to seek out those against whom they score highly. Individuals are modeled using finite state machines, allowing us to extend previous work on kin group markers. Though they have no direct effect on an individual’s strategy, such markers do lead to the emergence of coherent, mutually-cooperating sub-populations.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540389903</isbn><isbn>3540389903</isbn><isbn>3540389911</isbn><isbn>9783540389910</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkE1OwzAUhM2fRFu64gLesGAR8LMd_yxRKVBRBAtYR27iUEMSR3YqtTuuwfU4CSkFidWT5n0z0gxCp0AugBB5CaA4p1pmEvbQkKWcMKU1wD4agABIGOP6AI21VH8_wg7RgDBCEy05O0bDGN8IIVRqOkDL6bqtfHDNK-6WFk_L0uYd9iV-Cn7tatdtsGkKfO-auHQt9g1-WHUrU-GJ960NpnO95Jof86zbCrbovS76xoavj8-Ir11l69qcoKPSVNGOf-8IvdxMnyd3yfzxdja5mictBd0lUAhhU0I1ZVosFDNSslxYUGkpLQMllGSGcMlSWVhKF0wp4AVNibJEcCnYCJ3tclsTc1OVwTS5i1kbXG3CJgPdJ_R4z53vuNhu29uQLbx_jxmQbLtz9m9n9g25fmpa</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Frayn, Colin</creator><creator>Pryke, Andy</creator><creator>Chong, Siang Yew</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Exploring the Effect of Proximity and Kinship on Mutual Cooperation in the Iterated Prisoner’s Dilemma</title><author>Frayn, Colin ; Pryke, Andy ; Chong, Siang Yew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-1d66e50292396b83a773c6e185f7e3186873a047357de22b38814d2508e064763</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Frayn, Colin</creatorcontrib><creatorcontrib>Pryke, Andy</creatorcontrib><creatorcontrib>Chong, Siang Yew</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Frayn, Colin</au><au>Pryke, Andy</au><au>Chong, Siang Yew</au><au>Yao, Xin</au><au>Whitley, L. Darrell</au><au>Merelo-Guervós, Juan J.</au><au>Runarsson, Thomas Philip</au><au>Burke, Edmund</au><au>Beyer, Hans-Georg</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Exploring the Effect of Proximity and Kinship on Mutual Cooperation in the Iterated Prisoner’s Dilemma</atitle><btitle>Lecture notes in computer science</btitle><date>2006</date><risdate>2006</risdate><spage>701</spage><epage>710</epage><pages>701-710</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540389903</isbn><isbn>3540389903</isbn><eisbn>3540389911</eisbn><eisbn>9783540389910</eisbn><abstract>The iterated prisoner’s dilemma (IPD) has been used as a model for investigating cooperation in nature. Here, we present an analysis of the evolution of reciprocal cooperation in a dynamically simulated environment in which individual agents are free to move in space, interacting with their nearest neighbors in fixed-length IPD games. Agents aim to avoid those against whom they score poorly, and to seek out those against whom they score highly. Individuals are modeled using finite state machines, allowing us to extend previous work on kin group markers. Though they have no direct effect on an individual’s strategy, such markers do lead to the emergence of coherent, mutually-cooperating sub-populations.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11844297_71</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2006, p.701-710 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19687250 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Software Theoretical computing |
| title | Exploring the Effect of Proximity and Kinship on Mutual Cooperation in the Iterated Prisoner’s Dilemma |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T11%3A40%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Exploring%20the%20Effect%20of%20Proximity%20and%20Kinship%20on%20Mutual%20Cooperation%20in%20the%20Iterated%20Prisoner%E2%80%99s%20Dilemma&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Frayn,%20Colin&rft.date=2006&rft.spage=701&rft.epage=710&rft.pages=701-710&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540389903&rft.isbn_list=3540389903&rft_id=info:doi/10.1007/11844297_71&rft_dat=%3Cpascalfrancis_sprin%3E19687250%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540389911&rft.eisbn_list=9783540389910&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |