<?xml version="1.0" encoding="UTF-8"?><mycoreobject xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xsi:noNamespaceSchemaLocation="datamodel-jparticle.xsd" ID="jportal_jparticle_00206915" label="jportal_jparticle_00206915" version="2.0">
  <structure>
    <parents class="MCRMetaLinkID">
      <parent inherited="0" xlink:type="locator" xlink:href="jportal_jpvolume_00092979"/>
    </parents>
    <derobjects class="MCRMetaLinkID">
      <derobject inherited="0" xlink:type="locator" xlink:href="jportal_derivate_00200706" xlink:title="data object from jportal_jparticle_00206915"/>
    </derobjects>
  </structure>
  <metadata>
    <maintitles class="MCRMetaLangText" heritable="true" notinherit="false">
      <maintitle inherited="0" form="plain">Learning (Not) To Yield: An Experimental Study of Evolving&#13;
Ultimatum Game Behavior</maintitle>
      <maintitle inherited="1" form="plain">Volume 4</maintitle>
      <maintitle inherited="2" form="plain">Jena Economic Research Papers</maintitle>
    </maintitles>
    <participants class="MCRMetaLinkID" heritable="false" notinherit="false">
      <participant inherited="0" xlink:type="locator" xlink:href="jportal_person_00036213" xlink:title="Avrahami, Judith (Economist)" type="Angeblicher_Autor"/>
      <participant inherited="0" xlink:type="locator" xlink:href="jportal_person_00033352" xlink:title="Güth, Werner (Director Strategic Interaction Group, Max-Planck-Institute of Economics, Jena; Professor of Economics, University of Jena)" type="Angeblicher_Autor"/>
      <participant inherited="0" xlink:type="locator" xlink:href="jportal_person_00034254" xlink:title="Hertwig, Ralph (Economist)" type="Angeblicher_Autor"/>
      <participant inherited="0" xlink:type="locator" xlink:href="jportal_person_00036214" xlink:title="Kareev, Yaakov (Economist)" type="Angeblicher_Autor"/>
      <participant inherited="0" xlink:type="locator" xlink:href="jportal_person_00060302" xlink:title="Otsubo, Hironori (Economist)" type="Angeblicher_Autor"/>
    </participants>
    <dates class="MCRMetaISO8601Date" heritable="true" notinherit="false">
      <date inherited="0" type="published">2010-12-15</date>
      <date inherited="1" type="published">2010</date>
      <date inherited="2" type="published_from">2007</date>
    </dates>
    <identis class="MCRMetaLangText" heritable="false" notinherit="false">
      <identi inherited="0" form="plain" type="nodp">2010-092</identi>
    </identis>
    <keywords class="MCRMetaLangText" heritable="true" notinherit="false">
      <keyword inherited="0" form="plain">Ultimatum bargaining game</keyword>
      <keyword inherited="0" form="plain">Reputation</keyword>
      <keyword inherited="0" form="plain">Regret</keyword>
      <keyword inherited="0" form="plain">Learning</keyword>
      <keyword inherited="0" form="plain">Experiment</keyword>
    </keywords>
    <abstracts class="MCRMetaLangText" heritable="false" notinherit="false">
      <abstract inherited="0" form="plain">Whether behavior converges toward rational play or fair play in repeated ultimatum games depends on which player yields first. If responders concede first by accepting low offers, proposers would not need to learn to offer more, and play would converge toward unequal sharing. By the same token, if proposers learn fast that low offers are doomed to be rejected and adjust their offers accordingly, pressure would be lifted from responders to learn to accept such offers. Play would converge toward equal sharing. Here we tested the hypothesis that it is regret—both material and strategic—which determines how players modify their behavior. We conducted a repeated ultimatum game experiment with random strangers, in which one treatment does and another does not provide population feedback in addition to informing players about their own outcome. Our results show that regret is a good predictor of the dynamics of play. Specifically, we will turn to the dynamics that unfold when players make repeated decisions in the ultimatum game with randomly changing opponents, and when they learn not only about their own outcome in the previous round but also find out how the population on average has adapted to previous results (path dependence).</abstract>
    </abstracts>
    <types class="MCRMetaClassification" heritable="false" notinherit="false">
      <type inherited="0" classid="jportal_class_00000039" categid="001"/>
    </types>
    <classispub class="MCRMetaClassification" heritable="false" notinherit="false">
      <classipub inherited="0" classid="jportal_class_00000040" categid="en"/>
    </classispub>
    <classispub3 class="MCRMetaClassification" heritable="false" notinherit="false">
      <classipub3 inherited="0" classid="jportal_class_00000042" categid="00102000.00008000.00005000"/>
      <classipub3 inherited="0" classid="jportal_class_00000042" categid="00102000.00010000.00003000"/>
    </classispub3>
    <hidden_jpjournalsID class="MCRMetaLangText" heritable="true" notinherit="false">
      <hidden_jpjournalID inherited="2" form="plain">jportal_jpjournal_00000016</hidden_jpjournalID>
    </hidden_jpjournalsID>
  </metadata>
  <service>
    <servdates class="MCRMetaISO8601Date">
      <servdate inherited="0" type="createdate">2010-12-15T09:01:19.429Z</servdate>
      <servdate inherited="0" type="modifydate">2010-12-17T11:54:31.904Z</servdate>
    </servdates>
  </service>
</mycoreobject>