Proof of Lemma 14, p. 43 — R_i(N_i,j−1) ≥ R_i(N_ij) for j = 2, …, n
ProvedNestedLogitVariants.Synergistic.R_nbr_antitoneassortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
For an instance with fully-captured nests (), revenues ordered in each nest, and positive preference weights, the expected revenue of the nested-by-revenue assortments decreases along the nest: for every nest and every ,
Indeed is a weighted average of the largest revenues of nest . The fact gives in the proof of Theorem 7 (p. 43) and the first half of Lemma 14.
Formalization Note The standing assumptions are those of the model (see the Model definition) and of §4: every nest is fully captured, , and for some nest (p. 16). Revenues need only be nonnegative here. The range excludes .
Preamble
import Mathlib import Definitions.Def_NestedLogitVariants_Synergistic_Model
Formal statement
namespace NestedLogitVariants.Synergistic
/-- Proof of Lemma 14, p. 43: since `r_{i1} ≥ ⋯ ≥ r_{in}`, `R_i(N_{ij})` is a weighted average of the
first `j` revenues of nest `i` and `R_i(N_{i,j−1}) ≥ R_i(N_{ij})` for `j = 2, …, n`. -/
theorem R_nbr_antitone {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
(hI : I.Standing) (hfc : ∀ i, I.vnp i = 0) (hsyn : ∃ i, 1 < I.γ i)
(i : ι) (j : ℕ) (hj2 : 2 ≤ j) (hjn : j ≤ n) :
R I i (nbr n j) ≤ R I i (nbr n (j - 1)) := by sorry
end NestedLogitVariants.Synergistic
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. 43, proof of Lemma 14 (first two sentences), cited in Appendix A.1, p. 43
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.