AFTD Auto-Formalizing Theoretical Domains

is_efx_goods

def

An allocation is EFX if for every pair of distinct agents i and j, and every good g in j's bundle, agent i values her own bundle at least as much as j's bundle without g.

Statement

def is_efx_goods {m n : ℕ} (u : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) : Prop
Defined in
arXiv:2610.29201 Def 1
Verified
22 Oct 2026
Axioms
none listed
Built on 2
  • 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.
  • additive_valuationThe additive valuation with item values u: a bundle is worth the sum of its items' values.
Used by 52

Read back from the Lean

Given natural numbers m (number of goods) and n (number of agents), a utility profile u : Fin n → Fin m → ℝ, and an allocation function σ : Fin m → Fin n assigning each good to an agent: The definition is_efx_goods asserts that for all agents i, j : Fin n, if i ≠ j, then for every good g in agent j's bundle (bundle_of σ j), agent i's additive valuation of j's bundle with g removed is less than or equal to agent i's additive valuation of their own bundle (bundle_of σ i).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- An allocation of goods is EFX if removing any good from another agent's bundle eliminates envy. -/
def is_efx_goods {m n : ℕ} (u : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) : Prop :=
  ∀ i j : Fin n, i ≠ j → ∀ g ∈ bundle_of σ j,
    additive_valuation (u i) ((bundle_of σ j).erase g) ≤ additive_valuation (u i) (bundle_of σ i)
See it in the graphDiscuss this resultChallenge it