Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3.3, p. 14 — repeated-play extension with positive comparison cost

Proved
RobustPoA.Repeated.theorem_3_3

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

extension-theoremexternal-regretp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchyrepeated-play

Let GGG be a cost-minimization game with nonnegative joint cost CCC and finite robust price of anarchy ρ(G)\rho(G)ρ(G). Suppose the outcome sequence s1,s2,…s^1,s^2,\ldotss1,s2,… gives every player vanishing average external regret. For every comparison outcome s′s's′ with C(s′)>0C(s')>0C(s′)>0, there is a function η(T)→0\eta(T)\to0η(T)→0 such that, for every horizon T≥1T\geq1T≥1,

1T∑t=1TC(st)≤(ρ(G)+η(T))C(s′).\frac1T\sum_{t=1}^{T}C(s^t)\leq\bigl(\rho(G)+\eta(T)\bigr)C(s').T1​t=1∑T​C(st)≤(ρ(G)+η(T))C(s′).

This transfers a smoothness bound to repeated joint play without assuming that the outcomes converge to an equilibrium.

Formalization Note The printed theorem omits C(s′)>0C(s')>0C(s′)>0, but its multiplicative bound fails at zero comparison cost: one player may incur cost 1 once, then cost 0 forever, producing vanishing regret and positive average cost at every finite horizon. The preceding paragraph's additive bound has no such restriction. The nonnegative objective is the paper's standing convention. ρ(G)\rho(G)ρ(G) is the extended-real infimum; an admissible smoothness pair makes it finite here (with C(s′)>0C(s')>0C(s′)>0 it is a real number at least 1), which is the page's only non-vacuous case.

Preamble
import Mathlib
import Definitions.Def_RobustPoA_Static_Smoothness
import Definitions.Def_RobustPoA_Repeated_Regret
Formal statement
namespace RobustPoA.Repeated

/-- Theorem 3.3, with positive comparison cost needed for its multiplicative form. -/
theorem theorem_3_3 {ι : Type*} [Fintype ι] [DecidableEq ι] {S : ι → Type*}
    (C : ι → (∀ i, S i) → ℝ)
    (hC : ∀ s, 0 ≤ RobustPoA.Static.cost C s)
    (hsmooth : ∃ lam mu : ℝ, mu < 1 ∧ RobustPoA.Static.IsSmooth C lam mu)
    (seq : ℕ → ∀ i, S i) (hreg : VanishingRegret C seq)
    (s' : ∀ i, S i) (hpos : 0 < RobustPoA.Static.cost C s') :
    ∃ η : ℕ → ℝ, Filter.Tendsto η Filter.atTop (nhds 0) ∧
      ∀ T : ℕ, 1 ≤ T →
        (1 / (T : ℝ)) * ∑ t ∈ Finset.Icc 1 T, RobustPoA.Static.cost C (seq t) ≤
          (RobustPoA.Static.robustPoA C + η T) * RobustPoA.Static.cost C s' := by sorry

end RobustPoA.Repeated
Source
Roughgarden, Intrinsic Robustness of the Price of Anarchy, J. ACM 62(5) (2015), Theorem 3.3, §3.2, p. 14; corrected at C(s*) = 0
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me