Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2 — frequent re-solving loses Ω(√T) against hindsight

Proved
ResolvingNRM.FRLower.fr_regret_lower_bound

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

network-revenue-managementp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1poissonregret-lower-bound

Consider two independent rate-one Poisson customer classes that each consume one unit of a single resource. The initial resource capacity is the positive integer horizon TTT, and their prices satisfy 0<r2<r10<r_2<r_10<r2​<r1​. For every choice of optimal DLP solution used by Algorithm 2, there are constants M>0M>0M>0 and T0≥1T_0\ge1T0​≥1, depending only on the prices, such that for every T≥T0T\ge T_0T≥T0​,

vHO(T,T)−vFR(T,T)≥MT.v^{\mathrm{HO}}(T,T)-v^{\mathrm{FR}}(T,T)\ge M\sqrt T.vHO(T,T)−vFR(T,T)≥MT​.

Thus frequent re-solving can lose order T\sqrt TT​ even though it reoptimizes every period; the benchmark is the expected hindsight optimum.

Formalization Note Proposition 2 states existence of an instance, while its Appendix C.1 proof supplies this explicit two-class family. The assumption r2>0r_2>0r2​>0 is the positive-price reading needed for the paper's LP allocation formula; the inequality r2<r1r_2<r_1r2​<r1​ is stated on pp. 18 and 32. The threshold and constant are chosen before the LP selector and the horizon. The printed phase proof uses T∈3NT\in3\mathbb NT∈3N although the proposition is stated for all sufficiently large horizons; this gap is recorded in the moderation notes.

Preamble
import Mathlib
import Definitions.Def_ResolvingNRM_FRLower_Instance
Formal statement
namespace ResolvingNRM.FRLower

/-- Proposition 2 on the explicit two-class instance of Appendix C.1. The positive
constant and horizon threshold may depend on the two prices, but not on the DLP
tie-breaking selector or the horizon. -/
theorem fr_regret_lower_bound (r₁ r₂ : ℝ) (hr₂ : 0 < r₂) (hr : r₂ < r₁) :
    ∃ M : ℝ, 0 < M ∧ ∃ T₀ : ℕ, 1 ≤ T₀ ∧
      ∀ sel : (Fin 1 → ℝ) → Fin 2 → ℝ,
        IsDLPSelector (twoClass r₁ r₂ (le_of_lt hr₂) (le_of_lt hr)) sel →
        ∀ T : ℕ, T₀ ≤ T →
          hindsightValue (twoClass r₁ r₂ (le_of_lt hr₂) (le_of_lt hr)) (T : ℝ)
              (initialCapacity T) -
            frTail (twoClass r₁ r₂ (le_of_lt hr₂) (le_of_lt hr)) sel T
              (initialCapacity T) ≥ M * Real.sqrt (T : ℝ) := by sorry

end ResolvingNRM.FRLower
Source
Bumpensanti, Wang, A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Management, arXiv:1802.06192v3, Proposition 2 p. 18; Appendix C.1 pp. 32–34
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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