A Simple Bargaining Mechanism That Elicits Truthful Reservation Prices
We describe a simple 2-stage mechanism that induces two bargainers to be truthful in reporting their reservation prices in a 1st stage. If these prices criss-cross, the referee reports that they overlap, and the bargainers proceed to make offers in a 2nd stage. The average of the 2nd-stage offers becomes the settlement if both offers fall into the overlap interval; if only one offer falls into this interval, it is the settlement, but is implemented with probability 1/2; if neither offer falls into the interval, there is no settlement. Thus, if the bargainers reach the 2nd stage, they know their reservation prices overlap even if they fail to reach a settlement, possibly motivating them to try again.
|Date of creation:|
|Contact details of provider:|| Postal: 199 Aba Khoushy Ave., Mount Carmel, Haifa, Israel, 3498838|
Web page: http://hevra.haifa.ac.il/econ/index.php/en/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Myerson, Roger B. & Satterthwaite, Mark A., 1983.
"Efficient mechanisms for bilateral trading,"
Journal of Economic Theory,
Elsevier, vol. 29(2), pages 265-281, April.
- Roger B. Myerson & Mark A. Satterthwaite, 1981. "Efficient Mechanisms for Bilateral Trading," Discussion Papers 469S, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Steven J. Brams & D. Marc Kilgour, 2001. "Competitive Fair Division," Journal of Political Economy, University of Chicago Press, vol. 109(2), pages 418-443, April.
When requesting a correction, please mention this item's handle: RePEc:haf:huedwp:wp201102. 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: (Anna Rubinchik)
If references are entirely missing, you can add them using this form.