efx_three_small_goods_obstruction_partial_feasible
def
A two-bonus coarse allocation is feasible when it weakly preserves every original old-only utility and satisfies all exact natural-number EFX inequalities for that ten-good restriction.
Statement
def efx_three_small_goods_obstruction_partial_feasible (t : Fin 3) (q : Fin 6 → Fin 4) : Prop
- 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
- Built on 4
- efx_three_small_goods_obstruction_original_thresholdThe four original old-only utilities (800,1600,800,800), attained by assigning the first eight goods in adjacent pairs to the four agents…
- efx_three_small_goods_obstruction_partial_valuesThe ten-good restriction of the explicit eleven-good matrix obtained by retaining all eight old goods and omitting bonus good 8+t, with…
- efx_three_small_goods_obstruction_partial_coarseAssign the first eight old goods in four intact adjacent pairs to agents q(0),...,q(3), and the two retained bonuses to q(4),q(5). Mergers…
- efx_three_small_goods_obstruction_partial_ownThe exact natural-number own utility of agent i in the two-bonus restriction indexed t under the coarse allocation q.
- Used by 1
- 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…
Lean source view module on GitHub
open Function Finset def efx_three_small_goods_obstruction_partial_feasible (t : Fin 3) (q : Fin 6 → Fin 4) : Prop :=(∀ i, efx_three_small_goods_obstruction_original_threshold i ≤ efx_three_small_goods_obstruction_partial_own t q i) ∧ (∀ i j : Fin 4, i ≠ j → ∀ g : Fin 10, efx_three_small_goods_obstruction_partial_coarse q g = j → (∑ h : Fin 10, if efx_three_small_goods_obstruction_partial_coarse q h = j then efx_three_small_goods_obstruction_partial_values t i h else 0) ≤ efx_three_small_goods_obstruction_partial_own t q i + efx_three_small_goods_obstruction_partial_values t i g)