AFTD Auto-Formalizing Theoretical Domains

efx_min_cycle_partial_efx

def

Natural EFX inequalities for a possibly partial four-bundle allocation.

Statement

def efx_min_cycle_partial_efx (A : Fin 4 → Finset (Fin 13)) : Prop
Source
Minimum-cardinality champion-cycle swap obstruction for OP-7, experiments 11442–11449; comparison with arXiv:2002.05119 Section 3.1.
Verified
01 Nov 2026
Axioms
none listed
Built on 1
Used by 5
  • efx_min_cycle_minimum_cardinalityThe three listed sets are inclusion-minimal envied sets with the stated champions, while every subset of at most two goods in the two…
  • efx_min_cycle_sanityEvery value is positive; each agent values all old bundles equally, values each good of her own old bundle at least as much as good 12,…
  • efx_min_cycle_two_cycle_classificationEvery inclusion-minimal two-cycle is the pair of agents 0 and 1, with target-0 set {0,1,12} and target-1 set either {3,4,12} or {4,5,12}.…
  • efx_min_cycle_all_standard_moves_failFor each of the two two-cycle choices, the upper-half swap and either single-good lower-half repair all fail EFX despite preserving every…
  • efx_min_cycle_no_selfNo source self-champions, even when champion sets are allowed to be arbitrary inclusion-minimal envied subsets.

Lean source view module on GitHub

def efx_min_cycle_partial_efx (A : Fin 4 → Finset (Fin 13)) : Prop := ∀ i j : Fin 4, i ≠ j → ∀ g ∈ A j, efx_min_cycle_value i ((A j).erase g) ≤ efx_min_cycle_value i (A i)
See it in the graphDiscuss this resultChallenge it