efx_three_small_goods_obstruction_original_threshold
def
The four original old-only utilities (800,1600,800,800), attained by assigning the first eight goods in adjacent pairs to the four agents in order.
Statement
def efx_three_small_goods_obstruction_original_threshold : Fin 4 → ℕ- Source
- Route obstruction for efx_four_agents_additive_exists (OP-7), campaign IN-404, 2026-11-01. Experiments 11265, 11268, and 11269. The last independently exhausts all 16384 full coarse assignments and all 1152 old-permutation two-bonus states; a row scaling removes a welfare-maximizer tie. General Pareto-monotone EFX completion barriers are already known in arXiv:2002.05119v3 Section 5. This explicit three-universally-small-goods example constrains maximum-sum two-bonus completion, not EFX existence or the original-diagonal three-bonus conjecture, and carries no research-level novelty claim.
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Used by 3
- efx_three_small_goods_obstruction_partial_feasibleA two-bonus coarse allocation is feasible when it weakly preserves every original old-only utility and satisfies all exact natural-number…
- efx_three_small_goods_obstruction_maximalityFor every choice of omitted bonus t and every coarse allocation q keeping the four old pairs intact, if the two-bonus restriction…
- efx_three_small_goods_obstruction_sanityIn the explicit eleven-good instance all natural item values are strictly positive, and each of goods 8,9,10 is no more valuable than…
Lean source view module on GitHub
open Function Finset def efx_three_small_goods_obstruction_original_threshold : Fin 4 → ℕ :=![800,1600,800,800]