Punishing greediness in divide-the-dollar games
Theory and Decision, 2017, vol. 82, issue 3, No 3, 351 pages
Abstract Brams and Taylor 1994 presented a version of the divide-the-dollar game (DD), which they call DD1. DD1 suffers from the following drawback: when each player demands approximately the entire dollar, then if the least greedy player is unique, then this player obtains approximately the entire dollar even if he is only slightly less greedy than the other players. I introduce a parametrized family of 2-person DD games, whose “endpoints” (the games that correspond to the extreme points of the parameter space) are (1) a variant of DD1, and (2) a game that completely overcomes the greediness-related problem. I also study an n-person generalization of this family. Finally, I show that the modeling choice between discrete and continuous bids may have far-reaching implications in DD games.
Keywords: Bargaining games; Divide-the-dollar; Fair division (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s11238-016-9568-6 Abstract (text/html)
Access to full text is restricted to subscribers.
Working Paper: Punishing greediness in Divide-the-dollar games
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:kap:theord:v:82:y:2017:i:3:d:10.1007_s11238-016-9568-6
Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/11238/PS2
Access Statistics for this article
Theory and Decision is currently edited by Mohammed Abdellaoui
More articles in Theory and Decision from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().