Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2 — for cancelable valuations the bluff profile is an exact pure Nash equilibrium of Round-Robin

Proved
RoundRobinEq.CancelableBluff.theorem_3_2

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

cancelable-valuationsfair-divisionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pure-nash-equilibriumround-robin

Let n≥1n \ge 1n≥1 agents share m=knm = knm=kn indivisible goods, and let every agent's valuation viv_ivi​ be a cancelable valuation function (normalized and non-decreasing). Let ≻∗\boldsymbol\succ^*≻∗ be any strict variant of the truthful profile (each agent ranks the goods by non-increasing singleton value vi({g})v_i(\{g\})vi​({g}), ties broken in any fixed way), let h1,…,hmh_1, \dots, h_mh1​,…,hm​ be the goods in the order in which Round-Robin(≻∗)(\boldsymbol\succ^*)(≻∗) allocates them, and let ≻b=(≻b,…,≻b)\boldsymbol\succ^{\mathrm b} = (\succ^{\mathrm b}, \dots, \succ^{\mathrm b})≻b=(≻b,…,≻b) be the bluff profile, where every agent reports h1≻b⋯≻bhmh_1 \succ^{\mathrm b} \cdots \succ^{\mathrm b} h_mh1​≻b⋯≻bhm​.

Then ≻b\boldsymbol\succ^{\mathrm b}≻b is an exact pure Nash equilibrium of Round-Robin: for every agent iii and every ranking ≻i′\succ_i'≻i′​ of MMM,

vi(Ai(≻i′,≻−ib))≤vi(Ai(≻b)),v_i\big(A_i(\succ_i', \boldsymbol\succ^{\mathrm b}_{-i})\big) \le v_i\big(A_i(\boldsymbol\succ^{\mathrm b})\big),vi​(Ai​(≻i′​,≻−ib​))≤vi​(Ai​(≻b)),

where Ai(⋅)A_i(\cdot)Ai​(⋅) is agent iii's bundle in the allocation Round-Robin returns.

The result generalizes the known existence of exact equilibria of Round-Robin for additive valuations to the strictly larger class of cancelable valuations, with an explicit equilibrium that can be computed by running Round-Robin once on truthful reports.

Formalization Note The conclusion is IsApproxPNE 1 v (bluff σ): the bluff reports are rankings, and no deviation to any ranking τ raises the deviator's true value. The standing simplification m=knm = knm=kn (p. 7) is carried as the hypothesis hm; the reduction of general mmm by dummy goods is not formalized. The strict truthful profile σ is universally quantified, so the theorem holds for every tie-breaking, as on the page.

Preamble
import Mathlib
import Definitions.Def_RoundRobinEq_CancelableBluff_Setting
Formal statement
namespace RoundRobinEq.CancelableBluff

theorem theorem_3_2 {n : ℕ} [NeZero n] {M : Type*} [Fintype M] [DecidableEq M]
    (k : ℕ) (hm : Fintype.card M = k * n) (v : Fin n → Finset M → ℝ)
    (hv : ∀ i, IsValuation (v i)) (hc : ∀ i, IsCancelable (v i))
    (σ : Fin n → List M) (hσ : IsStrictTruthful v σ) :
    IsApproxPNE 1 v (bluff σ) := by sorry

end RoundRobinEq.CancelableBluff
Source
Amanatidis et al., Round-Robin Beyond Additive Agents, arXiv:2301.13652v1, p. 8, Theorem 3.2 (proof pp. 8–9)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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