Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.2 — every equilibrium guarantees every affordable ℓ-out-of-d maximin share

Proved
GenericBudgets.MaximinShare.proposition_3_2

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

competitive-equilibriumfair-divisionindivisible-goodsmaximin-sharep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let NNN be a finite set of agents, MMM a finite set of indivisible items, and viv_ivi​ an arbitrary cardinal valuation on bundles for each agent. Let the positive budgets satisfy ∑i∈Nbi=1\sum_{i\in N}b_i=1∑i∈N​bi​=1, and let (S,p)(S,p)(S,p) be a competitive equilibrium. For any agent iii and natural numbers ℓ,d\ell,dℓ,d with d>0d>0d>0 and ℓ/d≤bi\ell/d\le b_iℓ/d≤bi​, the allocated bundle guarantees her ℓ\ellℓ-out-of-ddd maximin share:

vi(Si)≥max⁡(T1,…,Td)  min⁡L⊆[d], ∣L∣=ℓvi ⁣(⋃t∈LTt).v_i(S_i)\ge \max_{(T_1,\ldots,T_d)}\; \min_{L\subseteq[d],\,|L|=\ell} v_i\!\left(\bigcup_{t\in L}T_t\right).vi​(Si​)≥(T1​,…,Td​)max​L⊆[d],∣L∣=ℓmin​vi​(t∈L⋃​Tt​).

Thus equilibrium gives an entitlement-sensitive fairness guarantee for every rational share no larger than an agent's budget, even when preferences are not additive.

Formalization Note The Lean goal uses the equivalent quantified form of the finite max–min formula. Positive normalized budgets are the paper's standing assumptions. No additivity, monotonicity, valuation normalization, or strictness is assumed for this proposition; 0≤ℓ≤d0\le\ell\le d0≤ℓ≤d follows from the displayed budget condition and budget normalization. Partitions may contain empty parts. Lean agents and items are zero-indexed.

Preamble
import Mathlib
import Definitions.Def_GenericBudgets_MaximinShare_Setting
Formal statement
namespace GenericBudgets.MaximinShare

/-- Proposition 3.2: every competitive equilibrium gives each agent her
`ℓ`-out-of-`d` maximin share when `ℓ / d` does not exceed her budget. -/
theorem proposition_3_2 {n m : ℕ} (v : Fin n → Finset (Fin m) → ℝ)
    (b : Fin n → ℝ) (hb : ∀ i, 0 < b i) (hsum : ∑ i, b i = 1)
    (σ : Fin m → Fin n) (p : Fin m → ℝ) (hCE : IsCE v b σ p)
    (i : Fin n) (ℓ d : ℕ) (hd : 0 < d) (hℓd : (ℓ : ℝ) / d ≤ b i) :
    GuaranteesMMS v σ i ℓ d := by sorry

end GenericBudgets.MaximinShare
Source
Babaioff, Nisan and Talgam-Cohen, Competitive Equilibrium with Indivisible Goods and Generic Budgets, arXiv:1703.08150v2, p. 9, Proposition 3.2; §2.1 standing budget assumptions, p. 6
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me