×

zbMATH — the first resource for mathematics

Nash bargaining theory when the number of alternatives can be finite. (English) Zbl 1066.91557
Summary: 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.

MSC:
91B26 Auctions, bargaining, bidding and selling, and other market models
PDF BibTeX XML Cite
Full Text: DOI