Theorem 3, p. 323 — a solution satisfying WPO, An, S. Inv, Cont and Mon is the Kalai–Smorodinsky solution
ProvedThomsonKS.Char.theorem_3bargainingcharacterizationkalai-smorodinskyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1population-monotonicity
Let be a solution: for every finite group of agents and every it selects a point . If satisfies weak Pareto-optimality (WPO), anonymity (An), scale invariance (S. Inv), continuity in the Hausdorff metric (Cont) and population monotonicity (Mon), then
where is the Kalai–Smorodinsky solution.
This is the uniqueness half of the characterization; Theorem 1 is the existence half.
Formalization Note " is the Kalai–Smorodinsky solution" is stated as agreement on every , since a solution is only defined on those problems.
Preamble
import Mathlib import Definitions.Def_ThomsonKS_Char_Setting
Formal statement
namespace ThomsonKS.Char
theorem theorem_3 (F : Solution) (hF : IsSolution F) (hW : WPO F) (hA : An F)
(hI : SInv F) (hC : Cont F) (hM : Mon F) :
∀ P : Finset ℕ, ∀ S ∈ DivProb P, F P S = KS P S := by sorry
end ThomsonKS.Char
Source
Thomson, The fair division of a fixed supply among a growing population, Math. Oper. Res. 8 (1983), p. 323, Theorem 3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.