Lemma D.1, PDF pp. 46–47 — shrinking MNL attraction values does not raise the optimal revenue
ProvedMultiStoreAssort.Approx.lemmaD1_attraction_monotoneassortment-optimizationmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider an MNL model with products, revenues and attraction values ; the outside option has attraction value . Let
the maximum taken over all assortments . Given with , let
Then .
The lemma says that the optimal MNL revenue is monotone in the attraction values. In the proof of Proposition 7 it bounds the revenue a store earns from the products of other stores, whose attraction values are discounted by , by the single-store optimum.
Formalization Note. The two optimal values are not formed as terms; the statement is: for every assortment there is an assortment whose revenue under is at least the revenue of under . No order or sign is assumed on the revenues, as in the lemma.
Preamble
import Mathlib import Definitions.Def_ChoiceCDLP_MNL_mnlObjective import Definitions.Def_MultiStoreAssort_Approx_Model
Formal statement
namespace MultiStoreAssort.Approx
/-- Lemma D.1 (Online Supplement pp. 14–15): scaling every attraction value down by a factor
`ε_i ∈ (0, 1)` does not increase the optimal MNL revenue: `R ≥ R'`, where
`R = max_S MultiStoreAssort.SMR.single r v S` and `R' = max_S MultiStoreAssort.SMR.single r (ε v) S`. -/
theorem lemmaD1_attraction_monotone {n : ℕ} (r v ε : Fin n → ℝ) (hv : ∀ i, 0 < v i)
(hε : ∀ i, 0 < ε i ∧ ε i < 1) :
∀ T : Finset (Fin n), ∃ S : Finset (Fin n), MultiStoreAssort.SMR.single r (fun i => ε i * v i) T ≤ MultiStoreAssort.SMR.single r v S := by sorry
end MultiStoreAssort.Approx
Source
Liu, Chen, Liu & Wan, Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing, authors' manuscript with Online and Additional Supplements (2024-09-17; MSOM DOI 10.1287/msom.2024.0761), PDF pp. 46–47 (Online Supplement pp. 14–15), Lemma D.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.