Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.2, p. 24 — γ(C) bounds each game’s robust price of anarchy

Proved
RobustPoA.Tight.proposition_5_2

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 C\mathcal CC be a nonempty set of admissible resource cost functions, and let GGG be any congestion game whose resource costs lie in C\mathcal CC. Then

ρ(G)≤γ(C),\rho(G)\le\gamma(\mathcal C),ρ(G)≤γ(C),

where ρ(G)\rho(G)ρ(G) is the best smoothness ratio for that game and γ(C)\gamma(\mathcal C)γ(C) is the best ratio from the resourcewise constraints (35). This makes γ(C)\gamma(\mathcal C)γ(C) a uniform robust price-of-anarchy bound for the class.

Formalization Note Both values are extended nonnegative reals. The class requires a nonempty strategy set for each player.

Preamble
import Definitions.Def_RobustPoA_Tight_Classes
Formal statement
namespace RobustPoA.Tight

open scoped ENNReal
open CongestionPoA.AsymSum

/-- Proposition 5.2, p. 24: the robust price of anarchy of any game in the class
is bounded by the resourcewise best smoothness ratio. -/
theorem proposition_5_2 (C : Set (ℕ → ℝ)) (hne : C.Nonempty)
    (hC : ∀ c ∈ C, IsCostFn c) {k m : ℕ}
    (G : CongestionGame (Fin k) (Fin m)) (hG : InClass C G) :
    robustPoACG G ≤ gamma C := by sorry

end RobustPoA.Tight
Source
Roughgarden, Intrinsic Robustness of the Price of Anarchy, J. ACM 62(5) (2015), Proposition 5.2, p. 24
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