publication . Article . 2002

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

Makoto Tanaka; Ryo-ichi Nagahisa;
Open Access
  • Published: 01 Jan 2002
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).
arXiv: Computer Science::Computer Science and Game TheoryNonlinear Sciences::Exactly Solvable and Integrable SystemsComputer Science::Computational ComplexityMathematics::Combinatorics
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue