<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-07-20T01:16:33Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/5236" metadataPrefix="marc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/5236</identifier><datestamp>2024-05-10T11:24:12Z</datestamp><setSpec>com_10259_3830</setSpec><setSpec>com_10259_5086</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_3832</setSpec></header><metadata><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
<leader>00925njm 22002777a 4500</leader>
<datafield tag="042" ind1=" " ind2=" ">
<subfield code="a">dc</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Sandholm, William H.</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Izquierdo, Segismundo S.</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Izquierdo Millán, Luis Rodrigo</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2019-11</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">We study population game dynamics under which each revising agent tests each&#xd;
of his strategies a fixed number of times, with each play of each strategy being&#xd;
against a newly drawn opponent, and chooses the strategy whose total payoff was&#xd;
highest. In the centipede game, these best experienced payoff dynamics lead to cooperative&#xd;
play. When strategies are tested once, play at the almost globally stable&#xd;
state is concentrated on the last few nodes of the game, with the proportions of&#xd;
agents playing each strategy being largely independent of the length of the game.&#xd;
Testing strategies many times leads to cyclical play.</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">1933-6837</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">http://hdl.handle.net/10259/5236</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">10.3982/TE3565</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Evolutionary game theory</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">backward induction</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">centipede game</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">computational algebra</subfield>
</datafield>
<datafield tag="245" ind1="0" ind2="0">
<subfield code="a">Best experienced payoff dynamics and cooperation in the centipede game</subfield>
</datafield>
</record></metadata></record></GetRecord></OAI-PMH>