Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.2, p. 14 β€” for a standard class containing the constants, two-link instances attain the worst Nash/optimal cost ratio over all networks, and it equals Ξ±(𝓛)

Proved
PoAIndep.Topology.theorem_4_2

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

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

Let G2G_2G2​ be the network with one source vertex, one sink vertex and two edges directed from source to sink. Let L\mathcal LL be a standard class of latency functions containing the constant functions. If I\mathcal II denotes the set of all instances with latency functions in L\mathcal LL and I2βŠ†I\mathcal I_2\subseteq\mathcal II2β€‹βŠ†I the single-commodity instances with underlying network G2G_2G2​, then

sup⁑(G2,r,β„“)∈I2ρ(G2,r,β„“)=Ξ±(L)=sup⁑(G,r,β„“)∈Iρ(G,r,β„“).\sup_{(G_2,r,\ell)\in\mathcal I_2}\rho(G_2,r,\ell)=\alpha(\mathcal L)=\sup_{(G,r,\ell)\in\mathcal I}\rho(G,r,\ell).(G2​,r,β„“)∈I2​sup​ρ(G2​,r,β„“)=Ξ±(L)=(G,r,β„“)∈Isup​ρ(G,r,β„“).

The statement consists of two parts.

  1. (Attained on two links.) For every b<Ξ±(L)b<\alpha(\mathcal L)b<Ξ±(L) there is a single-commodity instance on G2G_2G2​ with latency functions in L\mathcal LL, a feasible Nash flow fff and a feasible flow fβˆ—f^*fβˆ— with C(fβˆ—)>0C(f^*)>0C(fβˆ—)>0 and C(f)/C(fβˆ—)>bC(f)/C(f^*)>bC(f)/C(fβˆ—)>b.
  2. (Upper bound everywhere.) For every instance on any finite directed network with any number of commodities and latency functions in L\mathcal LL, every feasible Nash flow fff and every feasible flow fβˆ—f^*fβˆ— with C(fβˆ—)>0C(f^*)>0C(fβˆ—)>0 satisfy C(f)/C(fβˆ—)≀α(L)C(f)/C(f^*)\le\alpha(\mathcal L)C(f)/C(fβˆ—)≀α(L).

Part 1 gives sup⁑I2ρβ‰₯Ξ±(L)\sup_{\mathcal I_2}\rho\ge\alpha(\mathcal L)supI2​​ρβ‰₯Ξ±(L) and part 2 gives sup⁑Iρ≀α(L)\sup_{\mathcal I}\rho\le\alpha(\mathcal L)supI​ρ≀α(L); since instances on G2G_2G2​ are instances of the general model, sup⁑I2ρ≀sup⁑Iρ\sup_{\mathcal I_2}\rho\le\sup_{\mathcal I}\rhosupI2​​ρ≀supI​ρ, and the chain of equalities follows. The price of anarchy for such a class is thus independent of the network topology: the simplest two-link networks are already worst possible.

Formalization Note. The anarchy value and the ratios are compared in [0,∞][0,\infty][0,∞], so Ξ±(L)=∞\alpha(\mathcal L)=\inftyΞ±(L)=∞ is allowed. The paper's ρ(G,r,β„“)\rho(G,r,\ell)ρ(G,r,β„“) presupposes existence of Nash and optimal flows and the uniqueness of the Nash cost (Proposition 2.4, cited); the formal statement uses ratios C(f)/C(fβˆ—)C(f)/C(f^*)C(f)/C(fβˆ—) over all feasible Nash flows fff and all feasible flows fβˆ—f^*fβˆ— of positive cost instead, which expresses the same suprema without that dependence. G2G_2G2​ is constructed inside the general instance model.

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

theorem theorem_4_2 (L : Set (ℝ β†’ ℝ)) (hL : IsStandardClass L) (hc : ContainsConstants L) :
    (βˆ€ b : ENNReal, b < anarchyValue L β†’
      βˆƒ (r : ℝ) (hr : 0 < r) (β„“ : Fin 2 β†’ ℝ β†’ ℝ) (hβ„“ : βˆ€ e, IsLatency (β„“ e)),
        InClass (twoLink r hr β„“ hβ„“) L ∧
          βˆƒ f g : Flow (twoLink r hr β„“ hβ„“),
            IsFlow _ f ∧ IsFeasible _ f ∧ IsNashFlow _ f ∧
            IsFlow _ g ∧ IsFeasible _ g ∧ 0 < cost _ g ∧
            b < ENNReal.ofReal (cost _ f / cost _ g)) ∧
    (βˆ€ (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. 14, Theorem 4.2
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