Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2, PDF pp. 4–5 — at every Nash equilibrium on m identical links, c_i ≤ Σ_k w_k/m + ((m − 1)/m) w_i ≤ (2 − 1/m) opt

Proved
WorstCaseEq.Identical.theorem2_expected_cost_bound

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

approximation-ratioload-balancingnash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let nnn agents with positive traffics w1,…,wnw_1,\dots,w_nw1​,…,wn​ share m≥1m\ge1m≥1 identical links, let ppp be a Nash equilibrium, and let cic_ici​ be the expected cost of agent iii at ppp (the expected traffic on the link it picks). Let opt\mathrm{opt}opt be the least maximum link load over all assignments of agents to links. Then for every agent iii,

ci ≤ ∑kwkm+m−1m wi(6)c_i\ \le\ \frac{\sum_k w_k}{m}+\frac{m-1}{m}\,w_i \qquad (6)ci​ ≤ m∑k​wk​​+mm−1​wi​(6)

and

ci ≤ (2−1m) opt.c_i\ \le\ \Big(2-\frac1m\Big)\,\mathrm{opt}.ci​ ≤ (2−m1​)opt.

This is Theorem 2 of the paper: the expected cost seen by every individual agent at any equilibrium is within a factor 2−1/m2-1/m2−1/m of the optimum, for any number of agents and links. The sharper bound (6) is used, for m=2m=2m=2, in the proof of Theorem 3.

Formalization Note Positive traffics are part of the paper's model. Both conclusions are stated for every agent.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_WorstCaseEq_Identical_Model
Formal statement
namespace WorstCaseEq.Identical

/-- Theorem 2 with (6), PDF pp. 4–5: on `m` identical links, at every Nash equilibrium the expected cost
of each agent `i` is at most `∑_k w_k / m + ((m - 1)/m) w_i`, and at most `(2 - 1/m)` times the optimum. -/
theorem theorem2_expected_cost_bound {n m : ℕ} [NeZero m] (w : Fin n → ℝ) (hw : ∀ i, 0 < w i)
    (p : Fin n → Fin m → ℝ) (hp : IsNash w p) :
    ∀ i, expCost w p i ≤ (∑ k, w k) / m + (((m : ℝ) - 1) / m) * w i ∧
      expCost w p i ≤ (2 - 1 / (m : ℝ)) * opt m w := by sorry

end WorstCaseEq.Identical
Source
Koutsoupias & Papadimitriou, Worst-case equilibria (journal version, 2009), PDF pp. 4–5, Theorem 2, (6)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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