A characterization of the lexicographic Kalai-Smorodinsky solution for n=3

DOI10.1016/S0165-4896(98)00004-3zbMATH Open0937.91015OpenAlexW2004556896MaRDI QIDQ1296472FDOQ1296472

Chih Chang, Meng-Yu Liang

Publication date: 2 August 1999

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-4896(98)00004-3

zbMATH Keywords

leximin solutionKalai-Smorodinsky solution3-person bargaining problems

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites Work

• Other Solutions to Nash's Bargaining Problem
• The Fair Division of a Fixed Supply Among a Growing Population
• Axiomatic models of bargaining
• Individual Monotonicity and Lexicographic Maxmin Solution
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• TWO CHARACTERISATIONS OF THE LEXICOGRAPHIC EGALITARIAN SOLUTION
• Proportional concessions and the leximin solution
• Bargaining, conditional consistency, and weighted lexicographic Kalai-Smorodinsky solutions
• `Vintage' Nash bargaining without convexity

   Recommendations

• Individual monotonicity and the leximin solution 👍 👎
• Title not available (Why is that?) 👍 👎
• Characterization of the lexicographic egalitarian solution in the two-person bargaining problem 👍 👎
• Characterization of all individually monotonic bargaining solutions 👍 👎
• Axiomatic Characterizations of the Raiffa and the Kalai-Smorodinsky Solutions to the Bargaining Problem 👍 👎

This page was built for publication: A characterization of the lexicographic Kalai-Smorodinsky solution for \(n=3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296472)