Remark 1, p. 12 — appending a product never lowers the sequential revenue
ProvedAssortRotation.Concealment.remark_1assortmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-assortment
Products are offered sequentially to a consumer with nonnegative, decreasing marginal utility , who buys product iff with her past purchases. Let be the revenue from a sequence of products. Appending a further product with at the end cannot decrease the revenue:
Consequently an optimized sequential assortment may be taken to include all products. The optimized sequential revenue is therefore a maximum over orders of all products.
Formalization Note. The statement is pathwise, for an arbitrary list of (price, shock) pairs.
Preamble
import Mathlib import Definitions.Def_AssortRotation_Concealment_Model
Formal statement
namespace AssortRotation.Concealment
/-- Remark 1, p. 12. Appending one more product (with a nonnegative price) at the end of a
sequential assortment never lowers the sequential revenue `R^s` of (6). -/
theorem remark_1 (v : ℕ → ℝ) (hv : MarginalUtility v) (L : List (ℝ × ℝ)) (a : ℝ × ℝ)
(ha : 0 ≤ a.1) :
seqRev v L 0 ≤ seqRev v (L ++ [a]) 0 := by sorry
end AssortRotation.Concealment
Source
Ferreira & Goh, HBS Working Paper 17-041 (2020 revision), p. 12, Remark 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.