(3.11), p. 22 — a cost normalization Ψ_υ divides the distance of two games with equal demands by υ
ProvedSensitivityPoA.NoUniform.eq_3_11congestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysensitivity-analysis
Let and be games of the game space with the same demand vector, , and let . Then
where is the distance (3.3) and is the cost normalization.
With equal demands the demand term of the distance vanishes and the two cost terms are divided by . Together with the invariance of under , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.