Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, PDF p. 6 — the instance's social cost is (s₁ + 2s₂)/(s₁ + s₂)

Proved
WorstCaseEq.Speeds.instance_socialCost

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

makespanp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysocial-cost

Let 0<s1≤s20<s_1\le s_20<s1​≤s2​. On two links with speeds s1,s2s_1,s_2s1​,s2​, let two agents with traffic w1=s2w_1=s_2w1​=s2​, w2=s1w_2=s_1w2​=s1​ play the mixed profile

p11=s12s2(s1+s2),p21=1−s22s1(s1+s2),pi2=1−pi1.p_1^1=\frac{s_1^2}{s_2(s_1+s_2)},\qquad p_2^1=1-\frac{s_2^2}{s_1(s_1+s_2)},\qquad p_i^2=1-p_i^1 .p11​=s2​(s1​+s2​)s12​​,p21​=1−s1​(s1​+s2​)s22​​,pi2​=1−pi1​.

Then the expected makespan (the expected maximum over the two links of load divided by speed) is

cost⁡=(p11p21s1+p12p22s2)(w1+w2)+(p11p22s1+p12p21s2)w1=s1+2s2s1+s2.\operatorname{cost}=\Big(\frac{p_1^1p_2^1}{s_1}+\frac{p_1^2p_2^2}{s_2}\Big)(w_1+w_2)+\Big(\frac{p_1^1p_2^2}{s_1}+\frac{p_1^2p_2^1}{s_2}\Big)w_1=\frac{s_1+2s_2}{s_1+s_2}.cost=(s1​p11​p21​​+s2​p12​p22​​)(w1​+w2​)+(s1​p11​p22​​+s2​p12​p21​​)w1​=s1​+s2​s1​+2s2​​.

Together with opt⁡=1\operatorname{opt}=1opt=1 this gives the ratio 1+s2/(s1+s2)1+s_2/(s_1+s_2)1+s2​/(s1​+s2​) of Theorem 4.

Formalization Note The identity is algebraic and does not need s2≤φs1s_2\le\varphi s_1s2​≤φs1​ (outside that range the "profile" is not a probability distribution, but the expected-makespan sum is still defined). The hypothesis s1≤s2s_1\le s_2s1​≤s2​ decides which link carries the maximum when the agents split (w1/s1=s2/s1≥s1/s2=w2/s2w_1/s_1=s_2/s_1\ge s_1/s_2=w_2/s_2w1​/s1​=s2​/s1​≥s1​/s2​=w2​/s2​).

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_WorstCaseEq_Speeds_Model
Formal statement
namespace WorstCaseEq.Speeds

theorem instance_socialCost (s₁ s₂ : ℝ) (h₁ : 0 < s₁) (h₁₂ : s₁ ≤ s₂) :
    socialCost (instWeights s₁ s₂) (speeds s₁ s₂) (instProfile s₁ s₂)
      = (s₁ + 2 * s₂) / (s₁ + s₂) := by sorry

end WorstCaseEq.Speeds
Source
Koutsoupias & Papadimitriou, Worst-case equilibria (journal version, 2009), PDF p. 6, proof of Theorem 4 (cost computation)
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