Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.5, p. 22 — demand normalizations Λ_υ preserve the game space, WE and SO flows (scaled by 1/υ), and the price of anarchy

Proved
SensitivityPoA.SmallDemand.poa_demandNormalize

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

congestion-gamesdemand-normalizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchy

Let Γ=(τ,d)\Gamma = (\tau, d)Γ=(τ,d) be a game of the game space G(G,K,S)\mathcal G(G, \mathcal K, \mathcal S)G(G,K,S) and let υ>0\upsilon > 0υ>0. Let Λυ(Γ)=(τ∘υ,d/υ)\Lambda_\upsilon(\Gamma) = (\tau \circ \upsilon, d/\upsilon)Λυ​(Γ)=(τ∘υ,d/υ) be its demand normalization, with (τa∘υ)(x)=τa(xυ)(\tau_a \circ \upsilon)(x) = \tau_a(x\upsilon)(τa​∘υ)(x)=τa​(xυ). Then:

  1. Λυ(Γ)\Lambda_\upsilon(\Gamma)Λυ​(Γ) belongs to the game space;
  2. for every path vector fff, fff is a WE flow of Γ\GammaΓ if and only if f/υf/\upsilonf/υ is a WE flow of Λυ(Γ)\Lambda_\upsilon(\Gamma)Λυ​(Γ);
  3. for every path vector fff, fff is an SO flow of Γ\GammaΓ if and only if f/υf/\upsilonf/υ is an SO flow of Λυ(Γ)\Lambda_\upsilon(\Gamma)Λυ​(Γ);
  4. for every flow fff of Γ\GammaΓ, C(Γ,f)=υ⋅C(Λυ(Γ),f/υ)C(\Gamma, f) = \upsilon \cdot C(\Lambda_\upsilon(\Gamma), f/\upsilon)C(Γ,f)=υ⋅C(Λυ​(Γ),f/υ);
  5. the price of anarchy is invariant:
ρ(Λυ(Γ))=ρ(Γ).\rho(\Lambda_\upsilon(\Gamma)) = \rho(\Gamma).ρ(Λυ​(Γ))=ρ(Γ).

Rescaling the demand to total demand 111 in this way is what lets the small-demand regime be compared with a fixed reference game of total demand 111.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SensitivityPoA_SmallDemand_Setting
Formal statement
namespace SensitivityPoA.SmallDemand

open KellyStochasticNetworks

/-- §3.5, p. 22: a demand normalization `Λ_υ` maps the game space into itself; `˜f` and `f∗`
are a WE flow and an SO flow of `Γ` iff `˜f/υ` and `f∗/υ` are a WE flow and an SO flow of
`Λ_υ(Γ)`; `C(Γ, f) = υ · C(Λ_υ(Γ), f/υ)` for every flow `f` of `Γ`; hence `ρ(Λ_υ(Γ)) = ρ(Γ)`. -/
theorem poa_demandNormalize {N : Network} (Γ : Game N) (hΓ : Γ ∈ gameSpace N) (υ : ℝ)
    (hυ : 0 < υ) :
    demandNormalize υ Γ ∈ gameSpace N ∧
    (∀ f : Fin N.R → ℝ, IsWE Γ f ↔ IsWE (demandNormalize υ Γ) (fun r => f r / υ)) ∧
    (∀ f : Fin N.R → ℝ, IsSO Γ f ↔ IsSO (demandNormalize υ Γ) (fun r => f r / υ)) ∧
    (∀ f : Fin N.R → ℝ, IsFlow Γ f →
      cost Γ f = υ * cost (demandNormalize υ Γ) (fun r => f r / υ)) ∧
    PoA (demandNormalize υ Γ) = PoA Γ := by sorry

end SensitivityPoA.SmallDemand
Source
Wu, Möhring, A sensitivity analysis of the PoA in non-atomic congestion games, arXiv:2007.13979v3 (2021), p. 22, §3.5 (demand normalizations)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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