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

Article OPEN
Makoto Tanaka ; Ryo-ichi Nagahisa (2002)
  • Subject:
    arxiv: Mathematics::Combinatorics | Computer Science::Computational Complexity | Nonlinear Sciences::Exactly Solvable and Integrable Systems | Computer Science::Computer Science and Game Theory

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), Indep... View more
Share - Bookmark