Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 4.17 — the randomly biased min work mechanism is strongly truthful

Proved
AlgMechDesign.Randomized.rbmw_strongly_truthful

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

mechanism-designp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-mechanismscheduling

For every number kkk of tasks, the randomly biased min work mechanism (the uniform distribution over the biased min work mechanisms with β=4/3\beta = 4/3β=4/3 and s∈{1,2}ks \in \{1,2\}^ks∈{1,2}k) is universally strongly truthful:

  1. for every s∈{1,2}ks \in \{1,2\}^ks∈{1,2}k, the biased min work mechanism with parameters 4/34/34/3 and sss is truthful on positive types; and
  2. for every agent iii, every positive true type tit^iti and every positive misreport di≠tid^i \ne t^idi=ti, there are sss and a positive declaration d−id^{-i}d−i of the other agent under which declaring did^idi gives agent iii strictly smaller utility than declaring tit^iti.

Truthfulness is required for every outcome of the coin tosses, not in expectation.

Formalization Note Given part 1, part 2 says exactly that truth-telling is the only universally dominant strategy (Definition 16); the support of the uniform distribution is all of {1,2}k\{1,2\}^k{1,2}k.

Preamble
import Mathlib
import Definitions.Def_AlgMechDesign_Randomized_Model
import Definitions.Def_AlgMechDesign_Randomized_BiasedMinWork
Formal statement
namespace AlgMechDesign.Randomized

/-- Lemma 4.17: for every number `k` of tasks, the randomly biased min work mechanism
(`β = 4/3`, `s` uniform on `{1, 2}ᵏ`, full support) is universally strongly truthful. -/
theorem rbmw_strongly_truthful {k : ℕ} :
    IsUniversallyStronglyTruthful (n := 2) (k := k) (R := Fin k → Fin 2) rbmwAlloc rbmwPay := by sorry

end AlgMechDesign.Randomized
Source
Nisan, Ronen, Algorithmic Mechanism Design, Games Econ. Behav. 35, 2001, p. 182, Lemma 4.17
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