Author
Listed:
- Peter Paul Vanderschraaf
(Department of Political Economy & Moral Science, University of Arizona, Social Sciences 213, 1145 E. South Campus Drive, Tucson, AZ 85721, USA)
Abstract
I consider an underexplored possible explainer of the “surprising” results of Ultimatum Game experiments, namely, that Proposers and Recipients consider following only some of all the logically possible strategies of their Ultimatum Game. I present an evolutionary analysis of different games having the same set of allowable Proposer offers and functions that determine Proposer and Recipient payoffs. For Unrestricted Ultimatum Games , where Recipients may choose from among any of the logically possible pure strategies, populations tend to evolve most often to Nash equilibria where Proposers make the lowest allowable offer. However, for Threshold Reduced Ultimatum Games , where Recipients must choose from among minimum acceptable offer strategies, and for Range Reduced Ultimatum Games , where Recipients must choose from among pure strategies that spurn offers that are “too high” as well as “too low”, populations tend to evolve most often to Nash equilibria where Proposers offer substantially more than the lowest possible offer, a result that is consistent with existing Ultimatum Game experimental results. Finally, I argue that, practically speaking, actual Proposers and Recipients will likely regard some reduction of the Unrestricted Ultimatum Game as their game because, for them, the strategies of this reduction are salient.
Suggested Citation
Peter Paul Vanderschraaf, 2025.
"“Anything Goes” in an Ultimatum Game?,"
Games, MDPI, vol. 16(4), pages 1-33, July.
Handle:
RePEc:gam:jgames:v:16:y:2025:i:4:p:36-:d:1698088
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jgames:v:16:y:2025:i:4:p:36-:d:1698088. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.