Proof of Theorem 7, Eq. (11): cost after the projection reaches the newsvendor level
ProvedAIMInventory.UnknownBound.eq_11censored-demandinventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-gradient
For a horizon , sum over the rounds satisfying . The modified AIM target has expected cumulative newsvendor cost gap bounded by
This is the late-round contribution to the total regret guarantee, when lies within the growing projection intervals.
Formalization Note The finite horizon restriction implicit in the page is explicit. If , the sum starts at round one, even though the paper's ceiling threshold is zero. The initial target lies in .
Preamble
import Definitions.Def_AIMInventory_UnknownBound_AIM open MeasureTheory
Formal statement
namespace AIMInventory.UnknownBound
/-- Equation (11) in the proof of Theorem 7, over the rounds whose
projection interval contains the newsvendor quantity. -/
theorem eq_11 (P : CappedBaseStock.DemandLaw) (δ b h y₁ : ℝ) (T : ℕ)
(hδ : δ ∈ Set.Ioo (0 : ℝ) (1 / 2)) (hb : 0 < b) (hh : 0 < h)
(hy₁ : y₁ ∈ Set.Icc (0 : ℝ) 1) (hT : 1 ≤ T) :
(∫ d : CappedBaseStock.DemandPath,
(∑ t ∈ lateRounds δ (newsvendor P h b) T,
(cost P h b (modAimTarget δ b h y₁ d t) - cost P h b (newsvendor P h b)))
∂CappedBaseStock.demandPathLaw P) ≤
max b h * Real.rpow (T : ℝ) ((1 / 2 : ℝ) + δ) +
max b h * Real.rpow (T : ℝ) (1 / 2 : ℝ) := by sorry
end AIMInventory.UnknownBound
Source
Huh & Rusmevichientong, A Non-Parametric Asymptotic Analysis of Inventory Planning with Censored Demand, Math. Oper. Res. (2009), author's manuscript, p. 12, proof of Theorem 7, Eq. (11); https://doi.org/10.1287/moor.1080.0355
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.