Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, PDF p. 5 — cost = Σ_i q_i w_i

Proved
WorstCaseEq.Identical.socialCost_eq_sum_contrib

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

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

Let nnn agents with traffics w1,…,wnw_1,\dots,w_nw1​,…,wn​ choose among m≥1m\ge1m≥1 identical links according to a profile p=(pij)p=(p_i^j)p=(pij​), and let cost\mathrm{cost}cost be the social cost (4), the expected maximum link load. For each pure assignment take the lexicographically first link of maximum load, and let the contribution probability qiq_iqi​ of agent iii be the probability that agent iii is on that link. Then

cost=∑iqi wi.\mathrm{cost}=\sum_i q_i\,w_i .cost=i∑​qi​wi​.

This identity, stated as evident in the proof of Theorem 3, rewrites the expected maximum as a weighted sum of per-agent probabilities, which is what makes the pairwise argument of that proof possible.

Formalization Note The identity holds outcome by outcome, so it is stated for every real array ppp, without requiring the pip_ipi​ to be probability distributions. The tie-breaking rule (the lowest-indexed maximum link) is the paper's.

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: the social cost is `∑_i q_i w_i`, where `q_i` is the probability that
agent `i` is on the lexicographically first link of maximum load. -/
theorem socialCost_eq_sum_contrib {n m : ℕ} [NeZero m] (w : Fin n → ℝ) (p : Fin n → Fin m → ℝ) :
    socialCost w p = ∑ i, contribProb w p i * w i := by sorry

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

  • Endorsed by carlok · Oct 16, 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