Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tight instance, proof of Theorem 9 — it is a chores instance and every agent's max-min share is −1

Proved
MmSChores.RoundRobin.tight_instance_mms

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

choresfair-divisionmaximin-sharep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix N≥1N\ge 1N≥1 and consider the tight instance of Theorem 9: (N−1)N+1(N-1)N+1(N−1)N+1 chores, of which (N−1)N(N-1)N(N−1)N are worth −1N-\tfrac1N−N1​ and one is worth −1-1−1, with the same utility function ddd for all NNN agents. Then this is a chores instance, and every agent's max-min share is

MmSdN(M)=−1.\mathrm{MmS}^N_{d}(\mathcal M)=-1.MmSdN​(M)=−1.

The paper asserts that this instance shows the factor 2−1N2-\tfrac1N2−N1​ cannot be improved, without computing it; this statement is the max-min-share half of that computation.

Formalization Note The profile is fun _ : Fin N => tightUtil N, and the max-min share is LittleCharity.MMS.mms (bval … i) N univ, over all labelled, possibly empty, NNN-partitions of the chores.

Differences from the source:

  • encoding: the page asserts that the instance makes the bound tight, leaving the computation implicit → the max-min share of the instance is stated explicitly as −1; reason: this is the value the tightness claim needs, stated as its own item
Preamble
import Mathlib
import Definitions.Def_LittleCharity_MMS_Setting
import Definitions.Def_MmSChores_RoundRobin_Setting
import Definitions.Def_MmSChores_RoundRobin_TightInstance
Formal statement
namespace MmSChores.RoundRobin

open Finset

/-- Tight instance of Theorem 9 (PDF p. 4): the profile in which every one of the `N` agents has
the utility `tightUtil N` (`(N - 1) * N` chores worth `-1/N`, one chore worth `-1`) is a chores
instance, and every agent's max-min share is `-1`. -/
theorem tight_instance_mms {N : ℕ} (hN : 0 < N) :
    IsChores (fun _ : Fin N => tightUtil N) ∧
      ∀ i : Fin N,
        LittleCharity.MMS.mms (bval (fun _ : Fin N => tightUtil N) i) N univ = -1 := by sorry

end MmSChores.RoundRobin
Source
Aziz, Rauchecker, Schryen & Walsh, Algorithms for Max-Min Share Fair Allocation of Indivisible Chores, AAAI 2017, PDF p. 4, proof of Theorem 9, last paragraph (the computation the page leaves implicit)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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