App. E.1, PDF p. 47 — under SMR, each store's revenue is at most the single-store optimum θ*ᵢ
ProvedMultiStoreAssort.Pricing.storewise_boundjoint-pricingmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simultaneous-recommendation
Consider the multistore joint pricing model under simultaneous recommendation, with , , discounts and , and let solve with . For every assortment profile , every real price matrix , every best-store rule for and every store ,
The expected revenue of store under (13) never exceeds the optimal value of the single-store problem (14) with that store's parameters. Summing with the weights gives the upper bound in Theorem 6.
Preamble
import Mathlib import Definitions.Def_MultiStoreAssort_Pricing_Model
Formal statement
namespace MultiStoreAssort.Pricing
open Finset
theorem storewise_bound {m n : ℕ} (α β : Fin m → Fin n → ℝ) (c : Fin m → Fin m → Fin n → ℝ)
(hα : ∀ i k, 0 < α i k) (hβ : ∀ i k, 0 < β i k) (hc : ∀ i j k, 0 ≤ c i j k)
(hcii : ∀ i k, c i i k = 0) (θ : Fin m → ℝ) (hθ : ∀ i, IsTheta (α i) (β i) (θ i))
(S : Fin m → Finset (Fin n)) (P : Fin m → Fin n → ℝ) (l : Fin m → Fin n → Fin m)
(hl : IsBestStore α β c P S l) (i : Fin m) :
storeRev13 α β c S P l i ≤ θ i := by sorry
end MultiStoreAssort.Pricing
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), Online Supplement App. E.1, proof of Theorem 6, PDF p. 47
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.