Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.8, p. 12 β€” for any instance with latencies in a standard class 𝓛, ρ(G, r, β„“) ≀ Ξ±(𝓛)

Proved
PoAIndep.Topology.theorem_3_8

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

anarchy-valuep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchyselfish-routing

Let L\mathcal LL be a standard class of latency functions with anarchy value Ξ±(L)∈[1,∞]\alpha(\mathcal L)\in[1,\infty]Ξ±(L)∈[1,∞]. Let (G,r,β„“)(G,r,\ell)(G,r,β„“) be any instance β€” an arbitrary finite directed network with any number of commodities β€” whose edge latency functions all belong to L\mathcal LL. If fff is a feasible flow at Nash equilibrium and fβˆ—f^*fβˆ— is any feasible flow with C(fβˆ—)>0C(f^*)>0C(fβˆ—)>0, then

C(f)C(fβˆ—)≀α(L).\frac{C(f)}{C(f^*)}\le\alpha(\mathcal L).C(fβˆ—)C(f)​≀α(L).

Equivalently, ρ(G,r,β„“)≀α(L)\rho(G,r,\ell)\le\alpha(\mathcal L)ρ(G,r,β„“)≀α(L), where ρ\rhoρ is the ratio between the cost of a Nash flow and of an optimal flow.

This is the central technical result of the paper: the anarchy value, defined through two-link Pigou-type examples alone, bounds the inefficiency of selfish routing in every network.

Formalization Note. The paper's ratio ρ(G,r,β„“)\rho(G,r,\ell)ρ(G,r,β„“) presupposes that Nash and optimal flows exist and that all Nash flows have the same cost (Proposition 2.4, cited by the paper). The formal statement avoids that dependence: it bounds C(f)/C(fβˆ—)C(f)/C(f^*)C(f)/C(fβˆ—) for every feasible Nash flow fff and every feasible fβˆ—f^*fβˆ— of positive cost, which, since an optimal flow has the least cost, is the bound on ρ\rhoρ. The ratio is compared in [0,∞][0,\infty][0,∞].

Preamble
import Mathlib
import Definitions.Def_PoAIndep_Topology_Model
Formal statement
namespace PoAIndep.Topology

theorem theorem_3_8 (L : Set (ℝ β†’ ℝ)) (hL : IsStandardClass L) :
    βˆ€ (V E : Type) [Fintype V] [DecidableEq V] [Fintype E] [DecidableEq E] (I : Instance V E),
      InClass I L β†’ βˆ€ f g : Flow I, IsFlow I f β†’ IsFeasible I f β†’ IsNashFlow I f β†’
        IsFlow I g β†’ IsFeasible I g β†’ 0 < cost I g β†’
          ENNReal.ofReal (cost I f / cost I g) ≀ anarchyValue L := by sorry

end PoAIndep.Topology
Source
Roughgarden, The price of anarchy is independent of the network topology (journal-version manuscript, Dec. 23, 2002), p. 12, Theorem 3.8
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