p. 30 — the right-hand side of (13) at is bounded uniformly in
ProvedResolvingNRM.IRT.schedule_sum_boundedanalysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1re-solving
Let . For every there is a constant such that for every real ,
This is the analytic half of the proof of Theorem 1: it shows that both terms of the regret decomposition (13), evaluated at the IRT schedule, are .
Formalization Note Only the bound is stated, not the chain of inequalities printed on p. 30; its second inequality replaces by the upper bound inside , a function that is not increasing for . The bound itself holds because grows doubly exponentially in . The convention for at is that of the definition file ().
Preamble
import Mathlib import Definitions.Def_RLPBidPrice_Unbiased_Model import Definitions.Def_ResolvingNRM_IRT_Model open RLPBidPrice.Unbiased Matrix
Formal statement
namespace ResolvingNRM.IRT
theorem schedule_sum_bounded (κ : ℝ) (hκ : 0 < κ) :
∃ B : ℝ, ∀ T : ℝ, 1 ≤ T →
(∑ u ∈ Finset.range (Kirt T),
T ^ ((5 / 6 : ℝ) ^ u) * Real.exp (-κ * T ^ ((5 / 6 : ℝ) ^ u / 6))) +
T ^ ((5 / 6 : ℝ) ^ Kirt T / 2) ≤ B := by sorry
end ResolvingNRM.IRT
Source
Bumpensanti, Wang, A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Management, arXiv:1802.06192v3, Appendix B.1, p. 30 (bound on the right-hand side of (13))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.