efx_three_small_goods_obstruction_threshold
def
The four current utility thresholds (883,1992,800,800), attained by the starting EFX allocation of the first ten goods in the explicit three-small-goods instance.
Statement
def efx_three_small_goods_obstruction_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 9
- efx_three_small_goods_obstruction_no_zero_natEvery coarse allocation whose first old pair is given to agent 0 fails the conjunction of current utility preservation and the exact…
- efx_three_small_goods_obstruction_no_one_natEvery coarse allocation whose first old pair is given to agent 1 fails the conjunction of current utility preservation and the exact…
- 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_no_three_natEvery coarse allocation whose first old pair is given to agent 3 fails the conjunction of current utility preservation and the exact…
- efx_three_small_goods_completion_loss_or_splitIn the explicit eleven-good instance cast to real values, every complete EFX allocation which keeps each of the four old adjacent pairs…
- efx_three_small_goods_obstruction_no_two_natEvery coarse allocation whose first old pair is given to agent 2 fails the conjunction of current utility preservation and the exact…
- efx_three_small_goods_obstruction_feasible_natThe exact natural-number condition that a coarse eleven-good allocation both weakly preserves all four current utility thresholds and…
- 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…
- efx_three_small_goods_obstruction_no_current_irIn the explicit eleven-good instance cast to real values, every EFX coarse completion has some agent whose utility is strictly less than…
Lean source view module on GitHub
open Function Finset def efx_three_small_goods_obstruction_threshold : Fin 4 → ℕ :=![883,1992,800,800]