Theorem 5.1 — exact parity-dependent lower-bound threshold
DefinitionChoresTIE197_Main_Supplement_thresholdalgorithmic-game-theorychoresmaximin-sharep2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
For a number of agents define
This is the numerical threshold in the companion impossibility theorem, independent of any mechanism or costs. Denominators are real expressions, with converted to a real number before subtraction. The total definition returns zero for , outside every theorem's domain.
Definition code
import Mathlib noncomputable section namespace ChoresTIE197.Main.Supplement /-- Theorem 5.1, printed/PDF p.24. Arithmetic in the denominators is real. The value zero at n < 2 is outside the domain of every lower-bound theorem. -/ def threshold (n : ℕ) : ℝ := if n < 2 then 0 else if n = 2 then 4 / 3 else if n % 2 = 1 then max (1 + 1 / (3 * (n : ℝ) - 2)) (13 / 12) else max (1 + 1 / (3 * (n : ℝ) - 1)) (13 / 12) end ChoresTIE197.Main.Supplement
Source
Zehan Lin, Biaoshuai Tao, Xiaowei Wu, Yuhao Zhang, STOC 2027 submission #859 (October 2026), Theorem 5.1, printed p.24, PDF p.24; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/859.pdf