Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Claim 5.2, proof — the truthful corrected make-span is optimal

Proved
AlgMechDesign.CompBonus.optimality_corrStar

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

mechanism-designp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let x(⋅)x(\cdot)x(⋅) be an optimal allocation algorithm. Let t=(d−i,ti)t = (d^{-i}, t^i)t=(d−i,ti) be a positive type vector in which agent iii has its true type tit^iti and the others their declarations d−id^{-i}d−i, and let t′it'^it′i be any positive declaration of agent iii. Then

−g(x(t),corr∗(x(t),t))  ≥  −g(x(t′i,d−i),corr∗(x(t′i,d−i),t)).-g\big(x(t), \mathrm{corr}^*(x(t), t)\big) \;\ge\; -g\big(x(t'^i, d^{-i}), \mathrm{corr}^*(x(t'^i, d^{-i}), t)\big).−g(x(t),corr∗(x(t),t))≥−g(x(t′i,d−i),corr∗(x(t′i,d−i),t)).

Since corr∗(y,t)\mathrm{corr}^*(y, t)corr∗(y,t) lists each task at the time its assigned agent needs under ttt, both sides are make-spans −g(⋅,t)-g(\cdot, t)−g(⋅,t) of allocations under the same type vector, and the inequality says that a misreport by agent iii cannot produce an allocation that is better for ttt than the optimal one. It is the displayed inequality to which the proof of Claim 5.2 reduces truthfulness.

Preamble
import Mathlib
import Definitions.Def_AlgMechDesign_CompBonus_Model
import Definitions.Def_AlgMechDesign_CompBonus_Mechanism
Formal statement
namespace AlgMechDesign.CompBonus

/-- The displayed inequality in the proof of Claim 5.2 (p. 188): for an optimal allocation
algorithm `alloc`, a positive profile `t = (d⁻ⁱ, tⁱ)` and every positive declaration `ti'` of
agent `i`,
`-g(x(t), corr*(x(t), t)) ≥ -g(x(ti', d⁻ⁱ), corr*(x(ti', d⁻ⁱ), t))`. -/
theorem optimality_corrStar {n k : ℕ} [NeZero n]
    (alloc : (Fin n → Fin k → ℝ) → (Fin k → Fin n)) (hopt : IsOptimalAlloc alloc)
    (t : Fin n → Fin k → ℝ) (ht : IsType t) (i : Fin n) (ti' : Fin k → ℝ)
    (hti' : IsAgentType ti') :
    -gT (alloc (Function.update t i ti')) (corrStar (alloc (Function.update t i ti')) t) ≤
      -gT (alloc t) (corrStar (alloc t) t) := by sorry

end AlgMechDesign.CompBonus
Source
Nisan, Ronen, Algorithmic Mechanism Design, Games Econ. Behav. 35, 2001, p. 188, proof of Claim 5.2, first paragraph, displayed inequality in the third sentence and the fourth sentence
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me