Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.2 — every nnn-agent instance with qqq-partitioning valuations admits a ρ(q/n)\rho(q/n)ρ(q/n)-MMS allocation

Open
SubadditiveMMS580.Amplification.Supplement.theorem_1_2

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

fair-divisionmaximin-sharep2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1q-partitioning

Let q≥2q\ge2q≥2 be an integer and let ρ\rhoρ be the function of equation (1):

ρ(c)={c11−5c,0<c≤1,16,1≤c≤65,2(c−1)7c−6,65≤c≤2,14,c≥2.\rho(c)=\begin{cases}\dfrac{c}{11-5c},&0<c\le1,\\[4pt] \dfrac16,&1\le c\le\frac65,\\[4pt] \dfrac{2(c-1)}{7c-6},&\frac65\le c\le2,\\[4pt] \dfrac14,&c\ge2.\end{cases}ρ(c)=⎩⎨⎧​11−5cc​,61​,7c−62(c−1)​,41​,​0<c≤1,1≤c≤56​,56​≤c≤2,c≥2.​

Every instance with n≥1n\ge1n≥1 agents whose valuations v1,…,vnv_1,\dots,v_nv1​,…,vn​ on a finite set MMM of goods belong to Qq\mathcal Q_qQq​ admits a ρ(q/n)\rho(q/n)ρ(q/n)-MMS allocation: there are pairwise disjoint bundles A1,…,An⊆MA_1,\dots,A_n\subseteq MA1​,…,An​⊆M with

vi(Ai)≥ρ(q/n)⋅MMSn(vi;M)for every agent i.v_i(A_i)\ge\rho(q/n)\cdot\mathrm{MMS}_n(v_i;M)\qquad\text{for every agent }i.vi​(Ai​)≥ρ(q/n)⋅MMSn​(vi​;M)for every agent i.

In particular this gives a 1/61/61/6-MMS allocation when q≥nq\ge nq≥n and a 1/41/41/4-MMS allocation when q≥2nq\ge2nq≥2n.

This companion theorem gives constant MMS guarantees whenever q/nq/nq/n is bounded below, for valuation classes strictly between XOS and subadditive; it is not used in the proof of the mission's goal (Theorem 1.1).

Differences from the source:

  • encoding: an n-agent instance → n : ℕ with 1 ≤ n; reason: an instance has at least one agent; c = q/n is then positive
  • encoding: ρ on the closed pieces of (1), which agree at c = 1, 6/5, 2 → ρ on the half-open pieces (−∞,1], (1,6/5], (6/5,2], (2,∞); reason: adjacent formulas agree at the break points, so the value at every c > 0 is the same
  • encoding: partitions (C1,…,Ct)∈Π(S,t)(C_1,\dots,C_t)\in\Pi(S,t)(C1​,…,Ct​)∈Π(S,t) into t≤qt\le qt≤q nonempty groups (Definition 2.1) → 1 ≤ t ≤ q and C : Fin t → Finset (Fin m) with nonempty, pairwise disjoint members whose union is S; reason: the same ordered partitions
  • encoding: valuations vi:2M→R≥0v_i : 2^M \to \mathbb R_{\ge 0}vi​:2M→R≥0​, normalized and monotone → real set functions on Finset (Fin m) with the published IsNormalized and IsMonotone predicates; reason: normalization and monotonicity give nonnegativity, so the instances are the same
  • encoding: an allocation (pairwise disjoint bundles, goods may stay unassigned) → IsAllocation A (pairwise disjoint Finset bundles indexed by Fin n); reason: the source allows partial allocations (§2.1, p. 8); completing one cannot lower a monotone value
  • encoding: MMSn(vi;M)\mathrm{MMS}_n(v_i;M)MMSn​(vi​;M), the maximum over ordered partitions of MMM into nnn possibly empty bundles of the minimum bundle value → LittleCharity.MMS.mms (v i) n univ, a supremum over labelings Fin m → Fin n of the minimum labelled bundle value; reason: a labeling is exactly an ordered partition into n possibly empty bundles; the index set is finite and nonempty for n ≥ 1, so the supremum is the maximum
Preamble
import Mathlib
import Definitions.Def_SubadditiveMMS580_Amplification_Supplement_Partitioning
import Definitions.Def_MultiAllocToAlloc_Subadditive_Valuation
import Definitions.Def_MultiAllocToAlloc_Subadditive_Allocation
import Definitions.Def_LittleCharity_MMS_Setting

open MultiAllocToAlloc.Subadditive
Formal statement
namespace SubadditiveMMS580.Amplification.Supplement

/-- Theorem 1.2 (Partitioning valuations; Li–Sun, STOC 2027 submission #580, p. 3): for every
integer `q ≥ 2`, every `n`-agent instance (`n ≥ 1`) with valuations in `Q_q` on the goods
`Fin m` admits a `ρ(q/n)`-MMS allocation, with `ρ` the four-branch function of eq. (1). -/
theorem theorem_1_2 (q : ℕ) (hq : 2 ≤ q) (n : ℕ) (hn : 1 ≤ n) {m : ℕ}
    (v : Fin n → Finset (Fin m) → ℝ) (hv : ∀ i, IsQPartitioning q (v i)) :
    ∃ A : Fin n → Finset (Fin m), IsAllocation A ∧
      ∀ i : Fin n, rho ((q : ℝ) / n) * LittleCharity.MMS.mms (v i) n Finset.univ
        ≤ v i (A i) := by sorry

end SubadditiveMMS580.Amplification.Supplement
Source
Bo Li, Ankang Sun, Toward Constant-Factor Maximin Share Guarantees for Subadditive Valuations, STOC 2027 submission #580 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/580.pdf, sha256 7de124b5706e9e49301a281a1eb418a8ae32d04bf4cf0941b969cc3cde85e485, Theorem 1.2, p. 3 (PDF p. 3)

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