AFTD Auto-Formalizing Theoretical Domains

is_mxs_fair

def

An allocation is MXS-fair to agent i (minimum EFX share, arXiv:2502.02815, Def. 10) if i's bundle is worth to her at least her bundle in some allocation that is EFX-fair to her.

Statement

def is_mxs_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. 3, 10; formalized by the operator (Claude), 2026-10-03
Verified
02 Oct 2026
Axioms
none listed
Built on 2
  • is_efx_fairAn allocation is EFX-fair to agent i (arXiv:2502.02815, Def. 3, equal entitlements) if, against every other agent j, either i does not…
  • 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 2
  • mxs_fair_imp_prop1_fair_of_submodularOpen problem 3 of arXiv:2502.02815 has a positive answer: for submodular goods (monotone, v(empty) = 0) and equal entitlements, every…
  • 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

/-- Minimum EFX share (arXiv:2502.02815, Def. 10 with F = EFX, equal entitlements): agent `i`'s bundle under `σ` is worth to her at least her bundle in some allocation `τ` that is EFX-fair to her. -/
def is_mxs_fair {m n : ℕ} (v : Fin n → Finset (Fin m) → ℝ) (σ : Fin m → Fin n) (i : Fin n) : Prop :=
  ∃ τ : Fin m → Fin n, is_efx_fair v τ i ∧ v i (bundle_of τ i) ≤ v i (bundle_of σ i)
See it in the graphDiscuss this resultChallenge it