Nonconvex n-Person Bargaining: Efficient Maxmin Solutions
This paper provides an axiomatic characterization of a family of so-called efficient maxmin solutions which can be seen as generalizations of the Kalai-Smorodinsky solution to nonconvex n-person bargaining problems. Moreover, it is shown that even though there are several efficient maxmin solutions for some bargaining problems, there is typically a unique efficient maxmin solution.
|Date of creation:||Dec 1998|
|Date of revision:|
|Publication status:||Published in: Economic Theory 21(1) 2003, 81-95|
|Contact details of provider:|| Postal: Øster Farimagsgade 5, Building 26, DK-1353 Copenhagen K., Denmark|
Phone: (+45) 35 32 30 10
Fax: +45 35 32 30 00
Web page: http://www.econ.ku.dk
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:kud:kuiedp:9820. 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: (Thomas Hoffmann)
If references are entirely missing, you can add them using this form.