Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8 — existence of an EFX allocation with bounded charity

Proved
LittleCharity.EFX.theorem_8

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

efxenvy-graphfair-divisionindivisible-goodsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let there be n≥1n\ge1n≥1 agents with normalized and monotone valuations over a set MMM of mmm indivisible goods. Then there is an allocation X=⟨X1,…,Xn⟩X=\langle X_1,\dots,X_n\rangleX=⟨X1​,…,Xn​⟩ of pairwise disjoint bundles, with pool P=M∖⋃iXiP=M\setminus\bigcup_i X_iP=M∖⋃i​Xi​ of unallocated goods, such that

  1. XXX is EFX: vi(Xj∖{g})≤vi(Xi)v_i(X_j\setminus\{g\})\le v_i(X_i)vi​(Xj​∖{g})≤vi​(Xi​) for any agents i,ji,ji,j and g∈Xjg\in X_jg∈Xj​;
  2. no agent envies the pool: vi(P)≤vi(Xi)v_i(P)\le v_i(X_i)vi​(P)≤vi​(Xi​) for all iii;
  3. the pool is smaller than the number of sources of the envy graph, and in particular smaller than nnn:
∣P∣<#sources(GX),∣P∣<n.|P|<\#\mathrm{sources}(G_X),\qquad |P|<n .∣P∣<#sources(GX​),∣P∣<n.

Giving the pool away to charity therefore costs fewer than nnn goods, none of which any agent prefers to her own bundle. The strong form ∣P∣<#sources|P|<\#\mathrm{sources}∣P∣<#sources is the one used to derive the paper's maximin-share and groupwise-maximin-share guarantees.

Formalization Note The hypothesis n≥1n\ge1n≥1 is added: with no agents the bound ∣P∣<n|P|<n∣P∣<n fails as soon as m>0m>0m>0, and the paper always has agents. Valuations are real-valued; nonnegativity follows from normalized plus monotone. The theorem's last sentence ("Algorithm 1 determines such an allocation in at most nmV/ΔnmV/\DeltanmV/Δ iterations") is not posed: it requires a model of the algorithm's runs, and the count printed just before the theorem (at most nV/ΔnV/\DeltanV/Δ applications of U1U_1U1​/U2U_2U2​ and at most mmm successive applications of U0U_0U0​ between them) gives K+(K+1)mK+(K+1)mK+(K+1)m with K≤nV/ΔK\le nV/\DeltaK≤nV/Δ, which can exceed nmV/ΔnmV/\DeltanmV/Δ.

Preamble
import Mathlib
import Definitions.Def_LittleCharity_EFX_Setting
Formal statement
namespace LittleCharity.EFX

theorem theorem_8 {n m : ℕ} (hn : 0 < n)
    (v : Fin n → Finset (Fin m) → ℝ)
    (hnorm : IsNormalized v) (hmono : IsMonotoneVal v) :
    ∃ X : Fin n → Finset (Fin m),
      IsPartialAllocation X ∧ IsEFX v X ∧
      (∀ i, v i (pool X) ≤ v i (X i)) ∧
      (pool X).card < (sources v X).card ∧
      (pool X).card < n := by sorry
end LittleCharity.EFX
Source
Chaudhury, Kavitha, Mehlhorn & Sgouritsa, A Little Charity Guarantees Almost Envy-Freeness, arXiv:1907.04596v3, pp. 11–12, Theorem 8
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