Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Figure 3 — Pigou's example: Nash cost 111, optimal cost 3/43/43/4, so ρ=4/3\rho=4/3ρ=4/3

Proved
SelfishRouting.Linear.figure_3_pigou

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pigou-exampleprice-of-anarchyselfish-routing

The network of Figure 3 has one source–destination pair joined by two parallel links: the upper link has latency ℓ(x)=1\ell(x)=1ℓ(x)=1 and the lower link has latency ℓ(x)=x\ell(x)=xℓ(x)=x; the rate is 111. Then

  1. the flow (0,1)(0,1)(0,1), which puts the entire unit on the lower link, is at Nash equilibrium, and its cost is 111;
  2. the flow (12,12)(\tfrac12,\tfrac12)(21​,21​), which spreads the flow evenly over the two links, is optimal, and its cost is 34\tfrac3443​.

Hence ρ=C(f)/C(f∗)=4/3\rho=C(f)/C(f^*)=4/3ρ=C(f)/C(f∗)=4/3 in this instance, so the constant 4/34/34/3 of Theorem 4.5 cannot be lowered.

Formalization Note Route 000 is the upper link and route 111 the lower link; the incidence is the identity, there is one commodity, and the latencies are the linear latencies with a=(0,1)a=(0,1)a=(0,1), b=(1,0)b=(1,0)b=(1,0).

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SelfishRouting_Linear_Model
import Definitions.Def_SelfishRouting_Linear_LinearLatency
Formal statement
namespace SelfishRouting.Linear

/-- Figure 3 (pp. 11–12): two parallel links with latencies `ℓ(x) = 1` (route 0) and
`ℓ(x) = x` (route 1), one commodity, rate 1. The flow `(0, 1)` is at Nash equilibrium with
cost 1, and the flow `(1/2, 1/2)` is optimal with cost 3/4, so `ρ = 4/3`. -/
theorem figure_3_pigou :
    SelfishRouting.Bicriteria.IsNashFlow (fun j r : Fin 2 => if j = r then (1 : ℝ) else 0) (fun _ : Fin 2 => (0 : Fin 1))
        (linLatency ![0, 1] ![1, 0]) (fun _ => 1) ![0, 1] ∧
      SelfishRouting.Bicriteria.cost (fun j r : Fin 2 => if j = r then (1 : ℝ) else 0) (linLatency ![0, 1] ![1, 0])
        ![0, 1] = 1 ∧
      IsOptimalFlow (fun j r : Fin 2 => if j = r then (1 : ℝ) else 0)
        (fun _ : Fin 2 => (0 : Fin 1)) (linLatency ![0, 1] ![1, 0]) (fun _ => 1) ![1 / 2, 1 / 2] ∧
      SelfishRouting.Bicriteria.cost (fun j r : Fin 2 => if j = r then (1 : ℝ) else 0) (linLatency ![0, 1] ![1, 0])
        ![1 / 2, 1 / 2] = 3 / 4 := by sorry

end SelfishRouting.Linear
Source
Roughgarden & Tardos, How Bad is Selfish Routing?, J. ACM 49(2) (2002), author's manuscript of 5 Dec 2001, pp. 11–12, Figure 3 and the paragraph introducing it
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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