Bidding in common value fair division games: The winner's curse or even worse?
A unique indivisible commodity with an unknown common value is owned by group of individuals and should be allocated to one of them while compensating the others monetarily. We study the so-called fair division game (Güth, Ivanova-Stenzel, Königstein, and Strobel (2002, 2005)) theoretically and experimentally for the common value case and compare our results to the corresponding common value auction. Whereas symmetric risk neutral Nash equilibria are rather similar for both games, behavior differs strikingly. Implementing auctions and fair division games in the lab in a repeated setting under first- and second-price rule, we find that overall behavior is much more dispersed for the fair division games than for the auctions. Winners' profit margins and shading rates are on average slightly lower for the fair division game. Moreover, we find that behavior in the fair division game separates into extreme over- and underbidding.
|Date of creation:||04 Nov 2009|
|Contact details of provider:|| Postal: Carl-Zeiss-Strasse 3, 07743 JENA|
Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.jenecon.de
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:jrp:jrpwrp:2009-090. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Markus Pasche)
If references are entirely missing, you can add them using this form.