Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, PDF p. 4 — opt ≥ max{w_i, Σ_i w_i/m}

Proved
WorstCaseEq.Identical.opt_ge_max

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

load-balancinglower-boundmakespanp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let nnn agents with nonnegative traffics w1,…,wnw_1,\dots,w_nw1​,…,wn​ be assigned to m≥1m\ge1m≥1 identical links, and let opt\mathrm{opt}opt be the least possible maximum link load over all assignments of agents to links. Then

opt ≥ max⁡{wi, 1m∑kwk}for every agent i.\mathrm{opt}\ \ge\ \max\Big\{w_i,\ \frac{1}{m}\sum_{k}w_k\Big\}\qquad\text{for every agent } i .opt ≥ max{wi​, m1​k∑​wk​}for every agent i.

These are the two elementary lower bounds on the optimum that the paper uses to bound the price of anarchy: some link carries agent iii, and the busiest link carries at least the average load. For any mixed profile the expected traffics satisfy ∑jMj=∑iwi\sum_j M^j=\sum_i w_i∑j​Mj=∑i​wi​, so the average load is also ∑jMj/m\sum_j M^j/m∑j​Mj/m, which is how the page writes it.

Formalization Note The paper states the first bound for w1w_1w1​ under the ordering w1≥w2≥⋯≥wnw_1\ge w_2\ge\dots\ge w_nw1​≥w2​≥⋯≥wn​; the statement here gives it for every agent and assumes no ordering. Nonnegative traffics suffice.

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

/-- PDF p. 4: the social optimum is at least the traffic of every single agent and at least the average
load `∑_i w_i / m`. -/
theorem opt_ge_max {n m : ℕ} [NeZero m] (w : Fin n → ℝ) (hw : ∀ i, 0 ≤ w i) :
    (∀ i, w i ≤ opt m w) ∧ (∑ i, w i) / m ≤ opt m w := by sorry

end WorstCaseEq.Identical
Source
Koutsoupias & Papadimitriou, Worst-case equilibria (journal version, 2009), PDF p. 4, last paragraph of §2
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