Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5, inequality (1) — unilateral-deviation bound

Proved
CongestionPoA.AsymMax.inequality1

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

congestion-gameinequalityp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchy

Let AAA be a pure Nash profile and PPP any feasible profile in a finite congestion game with latencies fe(n)=aen+bef_e(n)=a_en+b_efe​(n)=ae​n+be​, where ae,be≥0a_e,b_e\ge0ae​,be​≥0. For every player iii,

ci(A)≤∑e∈Piaene(A)+ci(P).c_i(A)\le \sum_{e\in P_i} a_e n_e(A)+c_i(P).ci​(A)≤e∈Pi​∑​ae​ne​(A)+ci​(P).

This bounds the cost of an equilibrium player by the loads on the facilities in a comparison strategy and that player's comparison cost.

Formalization Note The paper displays the identity-latency case for player 1. The coefficient-weighted form covers its stated affine convention and is valid for every player.

Preamble
import Definitions.Def_CongestionPoA_AsymMax_Model

set_option autoImplicit false
Formal statement
namespace CongestionPoA.AsymMax

/-- Christodoulou and Koutsoupias, STOC 2005, Theorem 5, proof,
inequality (1), PDF p. 4. Formalization Note: an arbitrary player replaces the
paper's player 1. The coefficient-weighted term is the affine-latency form of
the printed identity-latency sum. -/
theorem inequality1 {ι E : Type*} [Fintype ι] [DecidableEq ι]
    [Fintype E] [DecidableEq E]
    (G : CongestionGame ι E) (a b : E → ℝ)
    (ha : ∀ e, 0 ≤ a e) (hb : ∀ e, 0 ≤ b e)
    (hlat : ∀ e n, G.latency e n = a e * n + b e)
    (A P : ι → Finset E) (hA : IsPureNash G A) (hP : IsProfile G P)
    (i : ι) :
    cost G A i ≤ (∑ e ∈ P i, a e * (load A e : ℝ)) + cost G P i := by sorry

end CongestionPoA.AsymMax
Source
Christodoulou and Koutsoupias, The Price of Anarchy of Finite Congestion Games, STOC 2005, DOI 10.1145/1060590.1060600, PDF p. 4, Theorem 5, proof, inequality (1)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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