AFTD Auto-Formalizing Theoretical Domains

chore_maximin_share

def

The maximin share (MMS) of an agent with additive chore costs u among n agents: the infimum over all partitions P : Fin m → Fin n of the supremum over bundles k : Fin n of the total cost of bundle P k to the agent.

Statement

noncomputable def chore_maximin_share {m : ℕ} (n : ℕ) (u : Fin m → ℝ) : ℝ
Defined in
arXiv:2611.00432, Section 2.1
Verified
03 Nov 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 18

Read back from the Lean

Given an implicit natural number m, an explicit natural number n, and a valuation function u : Fin m → ℝ, chore_maximin_share is the real number defined as the infimum over all assignments P : Fin m → Fin n of the supremum over all partition indices k : Fin n of the additive valuation of bundle_of P k.

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

/-- The maximin share (MMS) of an agent with additive chore costs among n agents. -/
noncomputable def chore_maximin_share {m : ℕ} (n : ℕ) (u : Fin m → ℝ) : ℝ := ⨅ P : Fin m → Fin n, ⨆ k : Fin n, additive_valuation u (bundle_of P k)
See it in the graphDiscuss this resultChallenge it