Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.3, p. 23 — games with regularly varying cost functions are asymptotically well designed: PoA(d⁽ⁿ⁾) → 1 for every unbounded demand sequence

Proved
LimitPoA.RegVar.theorem_3_3

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

asymptoticscongestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchyregular-variation

Let Γ\GammaΓ be a non-atomic congestion game with a finite non-empty set of groups and finitely many resources and strategies, satisfying (2.1), in which every group has a strategy. Suppose every resource cost function τa\tau_aτa​ is non-negative, non-decreasing and continuous on [0,∞)[0,\infty)[0,∞) and regularly varying: for every x>0x > 0x>0, lim⁡t→∞τa(tx)/τa(t)\lim_{t\to\infty}\tau_a(t x)/\tau_a(t)limt→∞​τa​(tx)/τa​(t) exists in (0,∞)(0,\infty)(0,∞). Then Γ\GammaΓ is asymptotically well designed: for every demand sequence (d(n))n∈N(d^{(n)})_{n\in\mathbb N}(d(n))n∈N​ with dk(n)≥0d^{(n)}_k \ge 0dk(n)​≥0 and T(d(n))=∑kdk(n)→∞T(d^{(n)}) = \sum_k d^{(n)}_k \to \inftyT(d(n))=∑k​dk(n)​→∞,

lim⁡n→∞PoA(d(n))=1.\lim_{n\to\infty}\mathrm{PoA}(d^{(n)}) = 1.n→∞lim​PoA(d(n))=1.

This is the main result of the paper. It holds without any growth condition on the demands, and the class of regularly varying costs contains all polynomials with non-negative coefficients, logarithmic factors, and their products and sums; each resource may have a different regular variation index.

Formalization Note The paper assumes dk>0d_k > 0dk​>0 for every group; the statement admits zero entries, which the paper's own sequences use and which is equivalent to applying the positive-demand version to every subgame. PoA(d)\mathrm{PoA}(d)PoA(d) is the worst NE cost (sSup) over the optimum cost (sInf); both sets are non-empty and bounded, so these are genuine values. The "scalable by decomposition" clause of the theorem is a separate milestone.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_LimitPoA_RegVar_Model
Formal statement
namespace LimitPoA.RegVar

/-- Theorem 3.3, p. 23: games with regularly varying cost functions are asymptotically well designed:
`PoA(d^(n)) → 1` along every unbounded demand sequence. -/
theorem theorem_3_3 (Γ : Game) (hΓ : Γ.Standing) (τ : Fin Γ.J → ℝ → ℝ)
    (hτ : ∀ a, IsCostFn (τ a)) (hrv : ∀ a, IsRegularlyVarying (τ a)) :
    IsAsymptoticallyWellDesigned Γ τ := by sorry

end LimitPoA.RegVar
Source
Wu, Möhring, Chen & Xu, Selfishness need not be bad, arXiv:1712.07464v2, p. 23, Theorem 3.3 (proof Appendix A.5, pp. 43–44, with Corollary 3.2)
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

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