Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Relation (23), p. 13 — one-step smoothness bound with deviation improvements

Proved
RobustPoA.Repeated.relation_23

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchyrepeated-playsmooth-games

Let GGG be a (λ,μ)(\lambda,\mu)(λ,μ)-smooth cost-minimization game with μ<1\mu<1μ<1. For any played outcome sss and comparison outcome s′s's′, define δi(s;s′)=Ci(s)−Ci(si′,s−i)\delta_i(s;s')=C_i(s)-C_i(s'_i,s_{-i})δi​(s;s′)=Ci​(s)−Ci​(si′​,s−i​). Then

C(s)≤λ1−μC(s′)+∑iδi(s;s′)1−μ.C(s)\leq\frac{\lambda}{1-\mu}C(s')+\frac{\sum_i\delta_i(s;s')}{1-\mu}.C(s)≤1−μλ​C(s′)+1−μ∑i​δi​(s;s′)​.

This one-step inequality is the input to the time-averaged bound in relation (25).

Formalization Note The paper introduces s′s's′ as a minimum-cost outcome when defining δi\delta_iδi​, but the derivation applies to every comparison outcome, as does Theorem 3.3.

Preamble
import Mathlib
import Definitions.Def_RobustPoA_Static_Smoothness
import Definitions.Def_RobustPoA_Repeated_Regret
Formal statement
namespace RobustPoA.Repeated

/-- Relation (23), allowing any comparison outcome as in the proof of Theorem 3.3. -/
theorem relation_23 {ι : Type*} [Fintype ι] [DecidableEq ι] {S : ι → Type*}
    (C : ι → (∀ i, S i) → ℝ) (lam mu : ℝ)
    (hsm : RobustPoA.Static.IsSmooth C lam mu) (hmu : mu < 1) (s s' : ∀ i, S i) :
    RobustPoA.Static.cost C s ≤ lam / (1 - mu) * RobustPoA.Static.cost C s' +
      (∑ i, delta C s' s i) / (1 - mu) := by sorry

end RobustPoA.Repeated
Source
Roughgarden, Intrinsic Robustness of the Price of Anarchy, J. ACM 62(5) (2015), (23), §3.2, p. 13
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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