p. 28 and A.6, p. 53 — every nonempty assortment of nest i lies in some level l = l^L_i, …, l^U_i
ProvedNestedLogitVariants.PowersDelta.exists_levelapproximation-algorithmsassortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Throughout, the instance satisfies the standing assumptions of §1, there is at least one product (), satisfies (the standing assumption of §6, p. 25), and . For every nest and every nonempty assortment there is an integer with and
This is the inclusion of p. 28, used in the proof of Theorem 12 to attach to an arbitrary assortment the level whose candidate it is compared with.
Formalization Note , are the ceilings of , (see the definition item). The section's standing assumption is carried for uniformity with the other statements; it is not used here.
Preamble
import Mathlib import Definitions.Def_NestedLogitVariants_PowersDelta_Levels
Formal statement
namespace NestedLogitVariants.PowersDelta
/-- p. 28 and A.6, p. 53: every nonempty assortment `S` of nest `i` lies in a level
`l ∈ {l^L_i, …, l^U_i}`, i.e. `δ^{l−1} ≤ v_{i0} + ∑_{j∈S} v_{ij} ≤ δ^l`; this is the inclusion
`[v^L_i, v^U_i] ⊂ [δ^{l^L_i − 1}, δ^{l^U_i}]`. -/
theorem exists_level {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} [NeZero n] (I : Instance ι n)
(hI : I.Standing) (γbar : ℝ) (hγbar : IsGreatest (Set.range I.γ) γbar) (hγbar1 : 1 < γbar)
(δ : ℝ) (hδ : 1 < δ)
(i : ι) (S : Finset (Fin n)) (hS : S.Nonempty) :
∃ l : ℤ, lL I i δ ≤ l ∧ l ≤ lU I i δ ∧ InLevel I i δ l S := 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. 28, §6.2 (definition of l^L_i, l^U_i) and p. 53, Appendix A.6 (choice of l)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.