A.6, p. 54 — if δ^(l−1) ≤ a ≤ δ^l then (δ^l)^(γ−1) ≥ δ^(−[1−γ]^+) a^(γ−1)
ProvedNestedLogitVariants.PowersDelta.rpow_lower_bound_levelapproximation-algorithmsassortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , , and a real number with . Then
where .
In the proof of Theorem 12 this is applied with for the arbitrary assortment , to pass from display (36) back to .
Formalization Note and are integer powers; the outer powers are real powers. is the pinned standing assumption .
Preamble
import Mathlib
Formal statement
namespace NestedLogitVariants.PowersDelta
/-- A.6, p. 54: if `δ^{l−1} ≤ a ≤ δ^l` (with `a = V_i(S_i)`), then
`(δ^l)^{γ−1} ≥ δ^{−[1−γ]^+} a^{γ−1}`, where `[t]^+ = max{t, 0}`. -/
theorem rpow_lower_bound_level (δ γ a : ℝ) (l : ℤ) (hδ : 1 < δ) (hγ : 0 < γ)
(ha1 : δ ^ (l - 1) ≤ a) (ha2 : a ≤ δ ^ l) :
δ ^ (-max (1 - γ) 0) * a ^ (γ - 1) ≤ (δ ^ l) ^ (γ - 1) := by sorry
end NestedLogitVariants.PowersDelta
Source
Davis, Gallego, Topaloglu, Assortment optimization under variants of the nested logit model, revised manuscript of June 18, 2013 (published Oper. Res. 62(2), 2014, DOI 10.1287/opre.2014.1256), p. 54, Appendix A.6, the bound on (δ^l)^{γ_i−1}
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.