§5.1, p. 24 — resourcewise smoothness implies game smoothness
ProvedRobustPoA.Tight.params_subsetcongestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysmooth-games
Let be a nonempty set of nonnegative, nondecreasing cost functions. Every parameter pair satisfying the resourcewise condition (35) makes every congestion game with costs from smooth. In symbols,
This inclusion connects the local inequality for one resource to the smoothness parameters of the entire game class.
Formalization Note The class ranges over every finite number of players and resources and every nonempty strategy set, rather than a fixed game size.
Preamble
import Definitions.Def_RobustPoA_Tight_Classes
Formal statement
namespace RobustPoA.Tight
/-- §5.1, p. 24, the sentence before Proposition 5.2: every parameter pair satisfying
the resourcewise constraints makes every game in the class smooth. -/
theorem params_subset (C : Set (ℕ → ℝ)) (hne : C.Nonempty)
(hC : ∀ c ∈ C, IsCostFn c) : smoothParams C ⊆ classParams C := by sorry
end RobustPoA.Tight
Source
Roughgarden, Intrinsic Robustness of the Price of Anarchy, J. ACM 62(5) (2015), §5.1, p. 24, sentence before Proposition 5.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.