<?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-06-19T18:06:39Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/7636" metadataPrefix="marc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/7636</identifier><datestamp>2024-05-10T11:56:38Z</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">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">2023-03</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">We consider population games played by procedurally rational players who, when revising their current strategy, test each of their available strategies independently in a series of random matches –i.e., a battery of tests–, and then choose the strategy that performed best in this battery of tests. This revision protocol leads to the so-called payoff-sampling dynamics (aka test-all Best Experienced Payoff dynamics).&#xd;
&#xd;
In this paper we characterize the support of all the rest points of these dynamics in any game and analyze the asymptotic stability of the faces to which they belong. We do this by defining strategy sets closed under payoff sampling, and by proving that the identification of these sets can be made in terms of simple comparisons between some of the payoffs of the game.</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">0899-8256</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">http://hdl.handle.net/10259/7636</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">10.1016/j.geb.2022.12.006</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Payoff sampling</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Best experienced payoff</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Procedural rationality</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Asymptotically stable sets</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Closed under payoff sampling</subfield>
</datafield>
<datafield tag="245" ind1="0" ind2="0">
<subfield code="a">Strategy sets closed under payoff sampling</subfield>
</datafield>
</record></metadata></record></GetRecord></OAI-PMH>