Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.2, (16)–(21), p. 13 — in a (λ, µ)-smooth game with µ < 1, every coarse correlated equilibrium has E[C(s)] ≤ λ/(1 − µ)·C(s*)

Proved
RobustPoA.Static.chain_16_21

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

coarse-correlated-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysmooth-games

Let GGG be a cost-minimization game with players iii, player costs CiC_iCi​ and joint cost C(s)=∑iCi(s)C(s) = \sum_i C_i(s)C(s)=∑i​Ci​(s), and suppose GGG is (λ,μ)(\lambda,\mu)(λ,μ)-smooth with μ<1\mu < 1μ<1. Then for every coarse correlated equilibrium σ\sigmaσ of GGG and every outcome s∗s^*s∗,

Es∼σ[C(s)]≤λ1−μ⋅C(s∗).\mathbf{E}_{s\sim\sigma}[C(s)] \le \frac{\lambda}{1-\mu} \cdot C(s^*).Es∼σ​[C(s)]≤1−μλ​⋅C(s∗).

This is the conclusion of the chain (16)–(21) in the proof of Theorem 3.2, for one fixed smoothness pair (λ,μ)(\lambda,\mu)(λ,μ); taking the infimum over admissible pairs gives Theorem 3.2.

Formalization Note Distributions are finitely supported probability weights on outcomes (see the definition item). No sign condition on λ\lambdaλ and no nonnegativity of costs is needed.

Preamble
import Mathlib
import Definitions.Def_RobustPoA_Static_Game
import Definitions.Def_RobustPoA_Static_Smoothness
import Definitions.Def_RobustPoA_Static_Distribution
Formal statement
namespace RobustPoA.Static

theorem chain_16_21 {ι : Type*} [Fintype ι] [DecidableEq ι] {S : ι → Type*}
    (C : ι → (∀ i, S i) → ℝ) (lam mu : ℝ)
    (hsmooth : IsSmooth C lam mu) (hmu : mu < 1)
    (σ : (∀ i, S i) →₀ ℝ) (hσ : IsCCE C σ) (sstar : ∀ i, S i) :
    expect σ (cost C) ≤ lam / (1 - mu) * cost C sstar := by sorry

end RobustPoA.Static
Source
Roughgarden, Intrinsic Robustness of the Price of Anarchy, J. ACM 62(5) (2015), proof of Theorem 3.2, (16)–(21), 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