AFTD Auto-Formalizing Theoretical Domains

is_eef1_fair

def

An allocation is epistemic-EF1-fair to agent i if some allocation gives i the same bundle and is EF1-fair to her.

Statement

def is_eef1_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 2
  • is_ef1_fairAn 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…
  • 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
  • mxs_fair_not_imp_eef1_fairOpen problem 1 of arXiv:2502.02815 has a negative answer: for additive goods and equal entitlements, MXS does not imply EEF1, already for…

Lean source view module on GitHub

/-- Epistemic EF1 (arXiv:2502.02815, Def. 9 with F = EF1): some allocation `τ` gives agent `i` the same bundle as `σ` and is EF1-fair to her. -/
def is_eef1_fair {m n : ℕ} (v : Fin n → Finset (Fin m) → ℝ) (σ : Fin m → Fin n) (i : Fin n) : Prop :=
  ∃ τ : Fin m → Fin n, bundle_of τ i = bundle_of σ i ∧ is_ef1_fair v τ i
See it in the graphDiscuss this resultChallenge it