Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 16 — every ε-Nash equilibrium of a (λ, µ)-smooth game with ε < 1/µ − 1 costs at most (1 + ε)λ/(1 − µ(1 + ε)) times optimal

Proved
RobustPoA.Static.eps_nash_bound

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

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

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, let sss be an ϵ\epsilonϵ-Nash equilibrium of GGG, and let s∗s^*s∗ be an optimal outcome, i.e. C(s∗)≤C(t)C(s^*) \le C(t)C(s∗)≤C(t) for every outcome ttt. Then

C(s)≤(1+ϵ)λ1−μ(1+ϵ)⋅C(s∗).C(s) \le \frac{(1+\epsilon)\lambda}{1-\mu(1+\epsilon)} \cdot C(s^*).C(s)≤1−μ(1+ϵ)(1+ϵ)λ​⋅C(s∗).

This is the approximate-equilibrium version of the pure Nash bound; Theorem 4.1 extends it to ϵ\epsilonϵ-coarse correlated equilibria.

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, which is what the derivation uses: the two agree for 0<μ<10 < \mu < 10<μ<1, while for μ=0\mu = 0μ=0 the printed form is meaningless (and in Lean 1/0=01/0 = 01/0=0 would make it ϵ<−1\epsilon < -1ϵ<−1) and for μ<0\mu < 0μ<0 it reverses. The condition ϵ≥0\epsilon \ge 0ϵ≥0 is the paper's implicit domain of an approximation parameter. Optimality of s∗s^*s∗ is kept as printed, although the bound holds for every outcome s∗s^*s∗.

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

theorem eps_nash_bound {ι : Type*} [Fintype ι] [DecidableEq ι] {S : ι → Type*}
    (C : ι → (∀ i, S i) → ℝ) (lam mu ε : ℝ)
    (hsmooth : IsSmooth C lam mu) (hε : 0 ≤ ε) (hεmu : mu * (1 + ε) < 1)
    (s : ∀ i, S i) (hs : IsEpsNash C ε s)
    (sstar : ∀ i, S i) (hopt : ∀ t : ∀ i, S i, cost C sstar ≤ cost C t) :
    cost C s ≤ (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), §4.1, first paragraph of p. 16 (with (26), p. 15)
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