Protected newsvendor under association: pooling a subset of retailers costs no more than the aggregate (C.18)
ProvedOWMR.arb_protected_newsvendorapproximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control
Let a network satisfy the standing assumptions and have associated demand components (Associated), and let be a set of retailers. Let , i.i.d. over periods, and . Then
where is the aggregate demand of all retailers over periods. The newsvendor problem of a sub-aggregate is no harder than that of the whole aggregate.
Preamble
import Definitions.Def_owmr_consolidation_policy open MeasureTheory open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem arb_protected_newsvendor {n : ℕ} (N : Network n) (hN : N.Standing) (hA : N.Associated)
(P : Finset (Fin n)) :
⨅ z : ℝ, ∫ w, whLoss N.h N.p (z - ∑ j, (w j : ℝ))
∂(Measure.pi fun _ : Fin N.L0 =>
(N.μ.map (fun x : DemandVec n => (∑ i ∈ P, x i : ℝ≥0)) : Measure ℝ≥0))
≤ ⨅ y : ℝ, N.fL0 y := by sorry
end OWMRSource
M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems", working paper (manuscript of November 2026), Appendix C, Step 4, (C.16)-(C.18), pp. E.14-E.15 (association of demand components, Esary, Proschan and Walkup 1967).