AFTD Auto-Formalizing Theoretical Domains

tfx_alphaTEFX

def

α-TEFX: the cumulative allocation is α-EFX after every round.

Statement

def tfx_alphaTEFX {T m : ℕ} (α : ℝ) (v : Fin 2 → Fin m → ℝ) (σ : Fin T → Fin m → Fin 2) :
    Prop
Defined in
Temporal Fair Division of Indivisible Goods with Structured Constraints (arXiv:2607.17224), Definitions 3, 4 and 8, Theorem 3 and the open question on the approximation ratio of TEFX under identical days (also arXiv:2601.12835); formalized by the operator (Claude), 2026-10-05
Verified
05 Oct 2026
Axioms
none listed
Built on 1
  • tfx_alphaEFXAtα-EFX of the cumulative allocation after round t: for all agents i ≠ j and every good (copy of type g from round s ≤ t) in j's bundle,…
Used by 3
  • tfx_coreCore case analysis: with three rounds of the goods {z, a, b} (values 0, 1, x), no allocation (given by its nine entries) is α-TEFX as soon…
  • tfx_identical_days_upper_boundIdentical days, two agents: no α-TEFX guarantee beyond 1/√2. For every α > √2/2 there is an identical-days instance with two agents having…
  • tfx_no_alphaTEFXFor the explicit instance with values 0, 1, x and three identical rounds, no allocation is α-TEFX whenever α x > 2, 2αx > x + 2 and α(x +…

Lean source view module on GitHub

/-- `α`-TEFX: the cumulative allocation is `α`-EFX after every round. -/
def tfx_alphaTEFX {T m : ℕ} (α : ℝ) (v : Fin 2 → Fin m → ℝ) (σ : Fin T → Fin m → Fin 2) :
    Prop :=
  ∀ t : ℕ, t < T → tfx_alphaEFXAt α v σ t
See it in the graphDiscuss this resultChallenge it