Theorem 1, p. 321 — the Kalai–Smorodinsky solution satisfies WPO, An, S. Inv, Cont and Mon
ProvedThomsonKS.Char.theorem_1Let be the Kalai–Smorodinsky solution: for every finite group of agents and every division problem , is the largest point of on the segment from the origin to the ideal point , . Then
That is: is weakly Pareto-optimal in ; it commutes with relabellings of the agents; it commutes with positive coordinatewise rescalings of utilities; it depends continuously on in the Hausdorff metric; and when a group is enlarged to with , no member of receives more in than in , .
This is the sufficiency half of the paper's characterization of the Kalai–Smorodinsky solution.
Formalization Note The fact that is a point of for every is implicit on the page (the solution selects "the maximal element of on the segment"); it is stated here as the first conjunct IsSolution KS.
import Mathlib import Definitions.Def_ThomsonKS_Char_Setting
namespace ThomsonKS.Char theorem theorem_1 : IsSolution KS ∧ WPO KS ∧ An KS ∧ SInv KS ∧ Cont KS ∧ Mon KS := by sorry end ThomsonKS.Char
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.