Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4, p. 10 — the pure price of anarchy is at most every valid smoothness ratio

Proved
RobustPoA.Tight.weak_duality

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

congestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysmooth-games

Let GGG be a finite congestion game with a nonnegative social cost on every feasible profile. If GGG is (λ,μ)(\lambda,\mu)(λ,μ)-smooth and μ<1\mu<1μ<1, then its pure price of anarchy satisfies

ρpure(G)≤λ1−μ.\rho_{\mathrm{pure}}(G)\le\frac{\lambda}{1-\mu}.ρpure​(G)≤1−μλ​.

This is the general upper-bound direction behind tightness: any smoothness certificate limits the cost of every pure Nash equilibrium relative to optimum.

Formalization Note The nonnegative objective is the standing assumption of §2.4. The extended-value convention covers an optimum of zero and games with no pure Nash equilibrium.

Preamble
import Definitions.Def_RobustPoA_Tight_Classes
Formal statement
namespace RobustPoA.Tight

open scoped ENNReal
open CongestionPoA.AsymSum

/-- §2.4, p. 10: the pure price of anarchy is bounded by any smoothness ratio. -/
theorem weak_duality {ι E : Type*} [Fintype ι] [DecidableEq ι]
    [Fintype E] [DecidableEq E] (G : CongestionGame ι E)
    (lam mu : ℝ) (hcost : ∀ A, IsProfile G A → 0 ≤ sumCost G A)
    (hsmooth : IsSmoothCG G lam mu) (hmu : mu < 1) :
    purePoA G ≤ ENNReal.ofReal (lam / (1 - mu)) := by sorry

end RobustPoA.Tight
Source
Roughgarden, Intrinsic Robustness of the Price of Anarchy, J. ACM 62(5) (2015), §2.4, p. 10, claim preceding Definition 2.8
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