Nash bargaining theory when the number of alternatives can be finite
Nash (1950) considered a domain of convex bargaining problems. We analyse domains including, or even consisting of, finite problems and provide various characterisations of the Nash Bargaining Solution (NBS). In particular, we extend Kaneko's (1980) results.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 15 (1998)
Issue (Month): 3 ()
|Note:||Received: 12 July 1996 / Accepted: 6 February 1997|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm |
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:15:y:1998:i:3:p:413-421. 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.