Theorem 2 for |P| = 2, pp. 321–322 — under WPO, An, S. Inv and Mon, F^P(S) ≧ K^P(S) for two-agent groups
ProvedThomsonKS.Char.theorem_2_card_twobargainingkalai-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 . Suppose satisfies weak Pareto-optimality (WPO), anonymity (An), scale invariance (S. Inv) and population monotonicity (Mon). Then for every two-agent group () and every ,
i.e. for both agents , where is the Kalai–Smorodinsky solution.
This is the case of Theorem 2 that the paper proves in the body of §3, by adding a single third agent; the general case is Theorem 2 (appendix).
Formalization Note Continuity is not assumed. The statement is the "only if" content of Theorem 2 restricted to ; the printed "if" direction is not part of it (see the Theorem 2 item).
Preamble
import Mathlib import Definitions.Def_ThomsonKS_Char_Setting
Formal statement
namespace ThomsonKS.Char
theorem theorem_2_card_two (F : Solution) (hF : IsSolution F) (hW : WPO F) (hA : An F)
(hI : SInv F) (hM : Mon F) (P : Finset ℕ) (hP : P.card = 2) (S : Set (P → ℝ))
(hS : S ∈ DivProb P) : KS P S ≤ F 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), pp. 321–322, Theorem 2, proof for |P| = 2 in §3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.