Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, PDF p. 5 — on two links, Σ_{k≠i} q_k w_k ≤ (3/2 − q_i) Σ_{k≠i} w_k at every equilibrium

Proved
WorstCaseEq.Identical.sum_contrib_le

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

load-balancingnash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchy

Let nnn agents with positive traffics w1,…,wnw_1,\dots,w_nw1​,…,wn​ share two identical links, let ppp be a Nash equilibrium, and let qkq_kqk​ be the contribution probability of agent kkk (the probability that it is on the lexicographically first link of maximum load). Then for every agent iii,

∑k≠iqk wk ≤ (32−qi)∑k≠iwk.\sum_{k\neq i}q_k\,w_k\ \le\ \Big(\frac32-q_i\Big)\sum_{k\neq i}w_k .k=i∑​qk​wk​ ≤ (23​−qi​)k=i∑​wk​.

The proof of Theorem 3 obtains this by combining (7), the collision form of cic_ici​ and the bound (6) for m=2m=2m=2; together with cost=∑kqkwk\mathrm{cost}=\sum_k q_kw_kcost=∑k​qk​wk​ and opt≥max⁡{12∑kwk,wi}\mathrm{opt}\ge\max\{\tfrac12\sum_kw_k,w_i\}opt≥max{21​∑k​wk​,wi​} it yields the 32\tfrac3223​ bound.

Formalization Note The two links are indexed by Fin 2. Positive traffics are part of the paper's model.

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

/-- Proof of Theorem 3, PDF p. 5: on two identical links, at every Nash equilibrium and for every agent
`i`, `∑_{k ≠ i} q_k w_k ≤ (3/2 - q_i) ∑_{k ≠ i} w_k`. -/
theorem sum_contrib_le {n : ℕ} (w : Fin n → ℝ) (hw : ∀ i, 0 < w i) (p : Fin n → Fin 2 → ℝ)
    (hp : IsNash w p) :
    ∀ i, ∑ k ∈ Finset.univ.erase i, contribProb w p k * w k ≤
      (3 / 2 - contribProb w p i) * ∑ k ∈ Finset.univ.erase i, w k := by sorry

end WorstCaseEq.Identical
Source
Koutsoupias & Papadimitriou, Worst-case equilibria (journal version, 2009), PDF p. 5, proof of Theorem 3, last display
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