AFTD Auto-Formalizing Theoretical Domains

is_ef1_fair

def

An allocation is EF1-fair to agent i if, against every other agent j, i does not envy j, or removing some item from j's bundle ends the envy, or removing some item from i's own bundle does.

Statement

def is_ef1_fair {m n : ℕ} (v : Fin n → Finset (Fin m) → ℝ) (σ : Fin m → Fin n) (i : Fin n) : Prop
Defined in
Exploring Relations among Fairness Notions in Discrete Fair Division, arXiv:2502.02815 v3, Defs. 2 and 9; formalized by the operator (Claude), 2026-10-03
Verified
02 Oct 2026
Axioms
none listed
Built on 1
  • bundle_ofUnder an allocation that gives each item x to agent s(x), agent i's bundle is the set of items given to i.
Used by 1
  • is_eef1_fairAn allocation is epistemic-EF1-fair to agent i if some allocation gives i the same bundle and is EF1-fair to her.

Lean source view module on GitHub

/-- EF1 (arXiv:2502.02815, Def. 2, equal entitlements), judged by agent `i`'s valuation `v i`: against every other agent `j`, either `i` does not envy `j`, or removing some item from `j`'s bundle ends the envy, or removing some item from `i`'s own bundle does. -/
def is_ef1_fair {m n : ℕ} (v : Fin n → Finset (Fin m) → ℝ) (σ : Fin m → Fin n) (i : Fin n) : Prop :=
  ∀ j, j ≠ i → v i (bundle_of σ j) ≤ v i (bundle_of σ i) ∨
    (∃ g ∈ bundle_of σ j, v i ((bundle_of σ j).erase g) ≤ v i (bundle_of σ i)) ∨
    (∃ c ∈ bundle_of σ i, v i (bundle_of σ j) ≤ v i ((bundle_of σ i).erase c))
See it in the graphDiscuss this resultChallenge it