Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.5 — for two agents every MMS allocation is EFX

Proved
StrategicAlloc.CutChoose.theorem_2_5

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

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

Let two agents have additive valuations v1,v2v_1,v_2v1​,v2​ with non-negative values vi(g)≥0v_i(g)\ge 0vi​(g)≥0 on a set MMM of mmm goods, and let A=(A1,A2)\mathcal A=(A_1,A_2)A=(A1​,A2​) be an allocation, i.e. a partition of MMM. Write μi=μi(2,M)\mu_i=\mu_i(2,M)μi​=μi​(2,M) for the maximin share of agent iii. If A\mathcal AA is MMS, that is,

vi(Ai) ≥ μi(i=1,2),v_i(A_i)\ \ge\ \mu_i\qquad (i=1,2),vi​(Ai​) ≥ μi​(i=1,2),

then A\mathcal AA is EFX: for all i,ji,ji,j with Aj≠∅A_j\neq\emptysetAj​=∅ and every g∈Ajg\in A_jg∈Aj​ with vi(g)>0v_i(g)>0vi​(g)>0, vi(Ai)≥vi(Aj∖{g})v_i(A_i)\ge v_i(A_j\setminus\{g\})vi​(Ai​)≥vi​(Aj​∖{g}).

The paper attributes this to Theorem 4.6 of Caragiannis et al. It turns the MMS guarantee of the equilibria of Mod-Cut&Choose into an EFX guarantee in the last step of the proof of Theorem 4.3.

Formalization Note EFX is the paper's Definition 2.1, which removes only goods of positive value; with the stronger variant that also removes zero-valued goods the statement would be false.

Preamble
import Mathlib
import Definitions.Def_LittleCharity_MMS_Setting
import Definitions.Def_StrategicAlloc_CutChoose_Setting
import Definitions.Def_StrategicAlloc_CutChoose_ModCutChoose
Formal statement
namespace StrategicAlloc.CutChoose

/-- Theorem 2.5 (p. 5): for two agents with additive non-negative valuations, every MMS
allocation is an EFX allocation (EFX as in Definition 2.1: only goods of positive value are
removed). -/
theorem theorem_2_5 {m : ℕ} (v : Fin 2 → Fin m → ℝ) (hv : ∀ i g, 0 ≤ v i g)
    (A : Fin 2 → Finset (Fin m)) (hA : StrategicAlloc.RRFair.IsAllocation A) (hmms : IsApproxMMS 1 v A) :
    IsEFX v A := by sorry

end StrategicAlloc.CutChoose
Source
Amanatidis et al., Allocating Indivisible Goods to Strategic Agents, arXiv:2109.08644v2, p. 5, Theorem 2.5
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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