Skip to main content
Log in

An axiomatization of the Kalai-Smorodinsky solution when the feasible sets can be finite

  • Published:
Social Choice and Welfare Aims and scope Submit manuscript

Abstract.

We axiomatize the Kalai-Smorodinsky solution (1975) in the Nash bargaining problems if the feasible sets can be finite. We show that the Kalai-Smorodinsky solution is the unique solution satisfying Continuity (in the Hausdorff topology endowed with payoffs space), Independence (which is weaker than Nash's one and essentially equivalent to Roth (1977)'s one), Symmetry, Invariance (both of which are the same as in Kalai and Smorodinsky), and Monotonicity (which reduces to a little bit weaker version of the original if the feasible sets are convex).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 4 November 1999/Accepted: 6 June 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nagahisa, Ri., Tanaka, M. An axiomatization of the Kalai-Smorodinsky solution when the feasible sets can be finite. Soc Choice Welfare 19, 751–761 (2002). https://doi.org/10.1007/s003550100150

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003550100150

Keywords

Navigation