Revising claims and resisting ultimatums in bargaining problems
Abstract
We propose a mechanism which implements a unique solution to the bargaining problem with two players in subgame-perfect equilibrium. Players start by making claims and accept a compromise only if they cannot gain by pursuing their claim in an ultimatum. The player offering the lowest resistance to his opponent’s claim can propose a compromise. The unique solution depends on the extent to which claims can be revised. If no revisions are allowed, compatible claims implement the Nash solution. If all revisions are allowed, maximal claims implement the Kalai-Smorodinsky solution.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by Katholieke Universiteit Leuven, Centrum voor Economische Studiën in its series Center for Economic Studies - Discussion papers with number ces0832.Length:
Date of creation: Dec 2008
Date of revision:
Handle: RePEc:ete:ceswps:ces0832
Contact details of provider:
Postal: Naamsestraat 69, 3000 Leuven
Phone: +32-(0)16-32 67 25
Fax: +32-(0)16-32 67 96
Email:
Web page: http://www.econ.kuleuven.be/ew
More information through EDIRC
Related research
Keywords:This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-01-17 (All new papers)
- NEP-GTH-2009-01-17 (Game Theory)
References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:ete:ceswps:ces0832For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Karla Vander Weyden).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

