Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9 — greedy round-robin gives every agent at least (2 − 1/N)·MmS on chores, and the factor cannot be improved

Proved
MmSChores.RoundRobin.theorem_9

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

approximationchoresfair-divisionmaximin-sharep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1round-robin

Let I=(M,[N],(di)i∈[N])I=(\mathcal M,[N],(d_i)_{i\in[N]})I=(M,[N],(di​)i∈[N]​) be an instance with N≥1N\ge 1N≥1 agents and additive utilities over a finite set M\mathcal MM of chores, and let

MmSdiN(M)=max⁡(S1,…,SN)∈ΠN(M) min⁡j∈[N]di(Sj)\mathrm{MmS}^N_{d_i}(\mathcal M)=\max_{(S_1,\dots,S_N)\in\Pi_N(\mathcal M)}\ \min_{j\in[N]} d_i(S_j)MmSdi​N​(M)=(S1​,…,SN​)∈ΠN​(M)max​ j∈[N]min​di​(Sj​)

be agent iii's max-min share, over all allocations into NNN (possibly empty) bundles. In the greedy round-robin protocol (Algorithm 1) the agents pick in rounds, in the order 1,…,N1,\dots,N1,…,N in each round, and each picker takes a remaining chore of highest utility for her; ties are broken arbitrarily. The theorem has three parts.

  1. The protocol always produces an allocation: for every utility profile there is a round-robin run.
  2. The guarantee: if di(j)≤0d_i(j)\le 0di​(j)≤0 for all iii and jjj, then for every run, with resulting allocation (S1,…,SN)(S_1,\dots,S_N)(S1​,…,SN​), and every agent iii,
di(Si) ≥ (2−1N)⋅MmSdiN(M).d_i(S_i)\ \ge\ \Big(2-\frac1N\Big)\cdot \mathrm{MmS}^N_{d_i}(\mathcal M).di​(Si​) ≥ (2−N1​)⋅MmSdi​N​(M).
  1. The factor cannot be improved: for every N≥1N\ge1N≥1 and every constant c<2−1Nc<2-\tfrac1Nc<2−N1​ there is a chores instance with NNN agents (di(j)≤0d_i(j)\le 0di​(j)≤0 and di≢0d_i\not\equiv 0di​≡0 for all iii) such that every round-robin run leaves some agent iii with di(Si)<c⋅MmSdiN(M)d_i(S_i)<c\cdot\mathrm{MmS}^N_{d_i}(\mathcal M)di​(Si​)<c⋅MmSdi​N​(M).

Since max-min shares of chores are non-positive, part 2 says every agent receives at most 2−1N2-\tfrac1N2−N1​ times her share of disutility, under every tie-breaking rule, and part 3 says no smaller factor holds for all instances with NNN agents.

Formalization Note Agents are Fin N (the paper's agent iii is index i−1i-1i−1), chores Fin m, utilities d : Fin N → Fin m → ℝ, di(S)d_i(S)di​(S) is bval d i S, a run is any σ : Fin m ≃ Fin m with IsRoundRobinRun d σ (pick t is made by agent t % N and takes a chore that agent weakly prefers to every chore taken at a later pick), SiS_iSi​ is rrBundle σ i, and the max-min share is the published LittleCharity.MMS.mms (bval d i) N univ. Part 2 needs no assumption that M\mathcal MM is nonempty: with no chores both sides are 000.

Differences from the source:

  • encoding: "the allocation obtained from Algorithm 1" (the protocol always terminates with an allocation) → part 1, the existence of a run for every profile, stated as a clause; reason: the run is a relation over all tie-breaking rules, and the clause makes explicit that the relation is nonempty, so parts 2 and 3 are not vacuous
  • generalization: guarantee for chores instances (d_i(j) ≤ 0 and d_i ≢ 0) → guarantee for all non-positive utilities, d_i ≢ 0 dropped; reason: with d_i ≡ 0 both sides are 0, and every chores instance satisfies the Lean hypotheses
  • reading: "the inequality cannot be improved for general instances" → for every N ≥ 1 and every c < 2 − 1/N there is a chores instance with N agents on which every run leaves some agent below c·MmS; reason: the factor 2 − 1/N depends on N, so the improvement is ruled out for each N separately, and the tie-breaking rule is arbitrary in the protocol, so the instance must defeat every run
Preamble
import Mathlib
import Definitions.Def_LittleCharity_MMS_Setting
import Definitions.Def_MmSChores_RoundRobin_Setting
Formal statement
namespace MmSChores.RoundRobin

open Finset

/-- Theorem 9 (PDF p. 4). (0) Algorithm 1 always produces an allocation: every utility profile
admits a greedy round-robin run. (a) For every `N ≥ 1` agents with non-positive additive
utilities, every run (every tie-breaking rule) and every agent `i`,
`d_i(S_i) ≥ (2 - 1/N) · MmS^N_{d_i}(M)`. (b) The factor cannot be improved: for every `N ≥ 1`
and every `c < 2 - 1/N` there is a chores instance with `N` agents on which every run leaves
some agent `i` with `d_i(S_i) < c · MmS^N_{d_i}(M)`. -/
theorem theorem_9 :
    (∀ (N m : ℕ) (d : Fin N → Fin m → ℝ), ∃ σ : Fin m ≃ Fin m, IsRoundRobinRun d σ) ∧
    (∀ (N m : ℕ), 0 < N → ∀ d : Fin N → Fin m → ℝ, (∀ i j, d i j ≤ 0) →
      ∀ σ : Fin m ≃ Fin m, IsRoundRobinRun d σ → ∀ i : Fin N,
        (2 - 1 / (N : ℝ)) * LittleCharity.MMS.mms (bval d i) N univ
          ≤ bval d i (rrBundle σ i)) ∧
    (∀ N : ℕ, 0 < N → ∀ c : ℝ, c < 2 - 1 / (N : ℝ) →
      ∃ (m : ℕ) (d : Fin N → Fin m → ℝ), IsChores d ∧
        ∀ σ : Fin m ≃ Fin m, IsRoundRobinRun d σ →
          ∃ i : Fin N, bval d i (rrBundle σ i) < c * LittleCharity.MMS.mms (bval d i) N univ) := 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, Theorem 9 (with Algorithm 1, PDF p. 4; Definitions 1–2, PDF p. 2)
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