Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorems 5–6 — maximum-cost price of anarchy grows as sqrt N

Proved
CongestionPoA.AsymMax.max_poa_theta_sqrt

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

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

The pure maximum-cost price of anarchy in finite linear congestion games has square-root order in the number of players. The upper statement holds for every N≥1N\ge1N≥1, every pure Nash profile AAA, and every feasible profile PPP:

MAX⁡(A)≤(1+5N2)MAX⁡(P).\operatorname{MAX}(A)\le\left(1+\sqrt{\frac{5N}{2}}\right)\operatorname{MAX}(P).MAX(A)≤(1+25N​​)MAX(P).

For every integer k≥2k\ge2k≥2, there is an identity-latency game with N=k(k−1)+1N=k(k-1)+1N=k(k−1)+1 players and kNkNkN facilities, a pure Nash profile AAA, and an optimal profile PPP with

MAX⁡(A)=k2,MAX⁡(P)=k.\operatorname{MAX}(A)=k^2,\qquad\operatorname{MAX}(P)=k.MAX(A)=k2,MAX(P)=k.

Every feasible profile QQQ in each lower instance has MAX⁡(Q)≥k\operatorname{MAX}(Q)\ge kMAX(Q)≥k. The upper inequality bounds the ratio against an optimal profile; the lower instances attain ratio k≥Nk\ge\sqrt Nk≥N​.

Formalization Note Linear means affine with nonnegative coefficients. The lower construction uses the corrected strategy index described under Theorem 6; the network realization is outside this statement.

Preamble
import Mathlib
import Definitions.Def_CongestionPoA_AsymMax_Model

set_option autoImplicit false
Formal statement
namespace CongestionPoA.AsymMax

/-- Christodoulou and Koutsoupias, STOC 2005, Theorems 5 and 6,
PDF pp. 4–5. The pure maximum-cost price of anarchy has order `√N`.
Formalization Note: the first clause is the proof's explicit upper bound for
every feasible comparison profile. The second fixes `N = k(k−1)+1` and
`kN` facilities with identity latencies, exact positive costs `k²`, `k`, and
optimality of the comparison profile.
It records the corrected denominator `k−1` implicit in Figure 2; the
paper's printed `k` makes the proposed profile fail to be Nash. The
network realization mentioned in Theorem 6 is not encoded. -/
theorem max_poa_theta_sqrt :
    (∀ (N : ℕ) (hN : 1 ≤ N),
      letI : Nonempty (Fin N) := ⟨⟨0, Nat.zero_lt_of_lt hN⟩⟩
      ∀ (E : Type) [Fintype E] [DecidableEq E]
        (G : CongestionGame (Fin N) E) (A P : Fin N → Finset E),
        IsLinear G → IsPureNash G A → IsProfile G P →
          maxCost G A ≤ (1 + Real.sqrt ((5 / 2 : ℝ) * N)) * maxCost G P) ∧
    (∀ (k : ℕ) (_hk : 2 ≤ k),
      let N := k * (k - 1) + 1
      letI : Nonempty (Fin N) := ⟨⟨0, Nat.succ_pos _⟩⟩
      ∃ (G : CongestionGame (Fin N) (Fin (k * N)))
        (A P : Fin N → Finset (Fin (k * N))),
        IsLinear G ∧
        (∀ e n, G.latency e n = (n : ℝ)) ∧
        IsPureNash G A ∧ IsProfile G P ∧
        maxCost G A = (k : ℝ) ^ 2 ∧ maxCost G P = (k : ℝ) ∧
        (∀ Q, IsProfile G Q → (k : ℝ) ≤ maxCost G Q)) := 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 pp. 4–5, Theorems 5 and 6
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