AFTD Auto-Formalizing Theoretical Domains

goods_utility

def

The utility vector of an allocation of goods under additive valuations: agent i's value for her own bundle.

Statement

def goods_utility {m n : ℕ} (u : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) : Fin n → ℝ
Defined in
The Unreasonable Fairness of Maximum Nash Welfare, ACM TEAC 7(3), 2019, Defs. 2.1-2.2 and App. B; formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Built on 2
  • additive_valuationThe additive valuation with item values u: a bundle is worth the sum of its items' values.
  • 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 8
  • is_fractionally_pareto_optimal_scaleMultiplying each agent's additive valuation vector by a positive scale c_i > 0 preserves and reflects fractional Pareto optimality.
  • is_leximin_ef1An allocation is leximin-optimal among EF1 allocations: it is EF1 and no EF1 allocation is strictly leximin-better.
  • lxv_leximin_lt_iffIn the instance, the real leximin comparison is equivalent to the lexicographic comparison of integer profiles.
  • pareto_dominates_goodsAllocation tau Pareto-dominates sigma: every agent weakly prefers tau and some agent strictly prefers it.
  • fpo_of_itemwise_weighted_maxIf an allocation σ assigns each item g to an agent maximizing w_i * u_i(g) for positive weights w, then σ is fractionally Pareto optimal…
  • is_fractionally_pareto_optimal_zero_goodsWhen there are no goods, every complete allocation is fractionally Pareto optimal.
  • lxv_goods_utilityThe real utility vector of an allocation in the instance is its integer own-bundle values divided by 20.
  • is_fractionally_pareto_optimalAn allocation of goods σ is fractionally Pareto optimal for additive valuations u if no fractional assignment x weakly improves every…

Lean source view module on GitHub

/-- Utility vector of the allocation `σ` (good `x` goes to agent `σ x`) under additive values `u`. -/
def goods_utility {m n : ℕ} (u : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) : Fin n → ℝ :=
  fun i => additive_valuation (u i) (bundle_of σ i)
See it in the graphDiscuss this resultChallenge it