Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1, p. 16 — every ε-coarse correlated equilibrium of a (λ, µ)-smooth game with ε < 1/µ − 1 has E[C(s)] ≤ (1 + ε)λ/(1 − µ(1 + ε))·C(s*)

Proved
RobustPoA.Static.theorem_4_1

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

approximate-equilibriumcoarse-correlated-equilibriumextension-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysmooth-games

Theorem 4.1 (Extension Theorem for Approximate Equilibria). Let GGG be a (λ,μ)(\lambda,\mu)(λ,μ)-smooth 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). Let ϵ≥0\epsilon \ge 0ϵ≥0 with μ(1+ϵ)<1\mu(1+\epsilon) < 1μ(1+ϵ)<1. Then for every ϵ\epsilonϵ-coarse correlated equilibrium σ\sigmaσ of GGG and every outcome s∗s^*s∗ of GGG,

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

The theorem shows that smoothness bounds degrade gracefully with the approximation parameter; at ϵ=0\epsilon = 0ϵ=0 it is the fixed-pair form of Theorem 3.2.

Formalization Note The paper's condition "ϵ<1/μ−1\epsilon < 1/\mu - 1ϵ<1/μ−1" is encoded as μ(1+ϵ)<1\mu(1+\epsilon) < 1μ(1+ϵ)<1: the two agree for 0<μ<10 < \mu < 10<μ<1, the printed form is meaningless at μ=0\mu = 0μ=0 (in Lean 1/0=01/0 = 01/0=0 would make it ϵ<−1\epsilon < -1ϵ<−1, a vacuous hypothesis) and reverses for μ<0\mu < 0μ<0. The condition ϵ≥0\epsilon \ge 0ϵ≥0 is the paper's implicit domain of an approximation parameter. The ϵ\epsilonϵ-coarse correlated equilibrium is the extension of (15) that §4.1 describes as defined "in the same way" as (26). Distributions are finitely supported.

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 theorem_4_1 {ι : Type*} [Fintype ι] [DecidableEq ι] {S : ι → Type*}
    (C : ι → (∀ i, S i) → ℝ) (lam mu ε : ℝ)
    (hsmooth : IsSmooth C lam mu) (hε : 0 ≤ ε) (hεmu : mu * (1 + ε) < 1)
    (σ : (∀ i, S i) →₀ ℝ) (hσ : IsEpsCCE C ε σ) (sstar : ∀ i, S i) :
    expect σ (cost C) ≤ (1 + ε) * lam / (1 - mu * (1 + ε)) * cost C sstar := by sorry

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