A New Insight into Three Bargaining Solutions in Convex Problems
We reconsider the three well-known solutions: the Nash, the egalitarian and the Kalai-Smorodinsky solutions, to the classical domains of convex bargaining problems. A new proof for the Nash solution that highlights the crucial role the axiom Contraction Independence plays is provided. We also give new axiomatic characterizations for both the egalitarian and the Kalai-Smorodinsky solutions. Our results focus on both contraction and expansion independence properties of bargaining problems and, as a consequence, some new insights on the three solutions from the perspective of rational choice may be derived.
|Date of creation:||Jul 2004|
|Note:||April 2004, Bibliography: p. 11-12|
|Contact details of provider:|| Postal: 2-1 Naka, Kunitachi City, Tokyo 186|
Web page: http://www.ier.hit-u.ac.jp/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:hit:hituec:a453. 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: (Hiromichi Miyake)
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.