Lemma 10c), p. 27 — WE flows of two games of a demand slice are mutually |A|·T(w)·‖Γ1 − Γ2‖-approximate WE flows
ProvedSensitivityPoA.Holder.lemma_10_capproximate-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysensitivity-analysis
Let and be two games of the game space with the same demand vector , and let and be WE flows of and . Then is an -approximate WE flow of and is an -approximate WE flow of , with
Combined with Lemma 1c) this gives the Hölder estimate of Lemma 10d).
Formalization Note (2.7) is stated for a small constant ; the formal notion of -approximate WE takes any real , and here when and coincide on .
Preamble
import Mathlib import Definitions.Def_KellyStochasticNetworks_Wardrop import Definitions.Def_SensitivityPoA_Holder_Setting
Formal statement
namespace SensitivityPoA.Holder
open KellyStochasticNetworks
/-- Lemma 10c), p. 27: WE flows of two games of a demand slice are mutually
`|A|·T(w)·‖Γ1 − Γ2‖`-approximate WE flows. -/
theorem lemma_10_c (N : Network) (hN : N.Standing) (Γ1 Γ2 : Game N)
(h1 : Γ1 ∈ gameSpace N) (h2 : Γ2 ∈ gameSpace N) (hd : Γ1.d = Γ2.d)
(ftil gtil : Fin N.R → ℝ) (hftil : IsWE Γ1 ftil) (hgtil : IsWE Γ2 gtil) :
IsApproxWE Γ2 ((N.J : ℝ) * totalDemand Γ1.d * gameDist Γ1 Γ2) ftil ∧
IsApproxWE Γ1 ((N.J : ℝ) * totalDemand Γ1.d * gameDist Γ1 Γ2) gtil := by sorry
end SensitivityPoA.Holder
Source
Wu, Möhring, A sensitivity analysis of the PoA in non-atomic congestion games, arXiv:2007.13979v3 (2021), p. 27, Lemma 10c)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.