Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.11), p. 22 — a cost normalization Ψ_υ divides the distance of two games with equal demands by υ

Proved
SensitivityPoA.NoUniform.eq_3_11

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

congestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysensitivity-analysis

Let Γ=(τ,d)\Gamma = (\tau, d)Γ=(τ,d) and Γ′=(σ,d′)\Gamma' = (\sigma, d')Γ′=(σ,d′) be games of the game space G(G,K,S)\mathcal G(G,K,S)G(G,K,S) with the same demand vector, d=d′d = d'd=d′, and let υ>0\upsilon > 0υ>0. Then

∥Ψυ(Γ)−Ψυ(Γ′)∥=∥Γ−Γ′∥υ,\|\Psi_\upsilon(\Gamma) - \Psi_\upsilon(\Gamma')\| = \frac{\|\Gamma - \Gamma'\|}{\upsilon},∥Ψυ​(Γ)−Ψυ​(Γ′)∥=υ∥Γ−Γ′∥​,

where ∥⋅∥\|\cdot\|∥⋅∥ is the distance (3.3) and Ψυ(τ,d)=(τ/υ,d)\Psi_\upsilon(\tau, d) = (\tau/\upsilon, d)Ψυ​(τ,d)=(τ/υ,d) is the cost normalization.

With equal demands the demand term of the distance vanishes and the two cost terms are divided by υ\upsilonυ. Together with the invariance of ρ\rhoρ under Ψυ\Psi_\upsilonΨυ​, this lets one push two games with different prices of anarchy arbitrarily close together, which is the mechanism behind Theorem 8a).

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SensitivityPoA_NoUniform_Setting
Formal statement
namespace SensitivityPoA.NoUniform

theorem eq_3_11 (N : Network) (Γ Γ' : Game N) (hΓ : Γ ∈ gameSpace N) (hΓ' : Γ' ∈ gameSpace N)
    (hd : Γ.d = Γ'.d) (υ : ℝ) (hυ : 0 < υ) :
    gameDist (costNormalize υ Γ) (costNormalize υ Γ') = gameDist Γ Γ' / υ := by sorry

end SensitivityPoA.NoUniform
Source
Wu, Möhring, A sensitivity analysis of the PoA in non-atomic congestion games, arXiv:2007.13979v3 (2021), p. 22, eq. (3.11)
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