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

DOI10.1016/S0165-4896(98)00004-3zbMath0937.91015OpenAlexW2004556896MaRDI QIDQ1296472

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)

Related Items

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

Cites Work

• Axiomatic models of bargaining
• The Fair Division of a Fixed Supply Among a Growing Population
• Individual Monotonicity and Lexicographic Maxmin Solution
• Other Solutions to Nash's Bargaining Problem
• Unnamed Item
• Unnamed Item