Theorem 6, PDF p. 28 — under SMR, the full assortment in every store at prices θ*ᵢ + 1/βᵢₖ solves the joint problem (13)
ProvedMultiStoreAssort.Pricing.theorem6_full_assortment_markupA seller runs stores and sells products. A fraction of customers visits store , . A store- customer who buys product from store at store 's price has utility plus Gumbel noise, with , , and . Under simultaneous recommendation the seller's expected revenue is the objective of problem (13), where products of are bought from the store that maximizes the customer's utility among the stores offering them. For each store let be the solution of
Theorem 6. The profile with prices
is an optimal solution of (13): for every assortment profile , every real price matrix and every best-store rule for ,
Under simultaneous recommendation, the joint assortment and pricing problem thus decouples: offering every product everywhere, at the single-store "constant adjusted markup" prices, earns as much as any coordinated multistore policy.
Formalization Note Optimality is a global upper bound over all profiles, all real prices and all tie-breaking rules ; uniqueness is not claimed. On the full profile , so the right-hand side does not depend on its selection , which is quantified universally. enters as a hypothesis (the markup equation holds), whose solvability and uniqueness is a separate milestone. is the page's ; the statement remains true without it.
import Mathlib import Definitions.Def_MultiStoreAssort_Pricing_Model
namespace MultiStoreAssort.Pricing
open Finset
theorem theorem6_full_assortment_markup {m n : ℕ} (lam : Fin m → ℝ) (α β : Fin m → Fin n → ℝ)
(c : Fin m → Fin m → Fin n → ℝ) (hlam : ∀ i, 0 ≤ lam i) (hlam1 : ∑ i, lam i = 1)
(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 l' : Fin m → Fin n → Fin m),
IsBestStore α β c P S l →
rev13 lam α β c S P l ≤
rev13 lam α β c (fun _ => Finset.univ) (fun i k => θ i + 1 / β i k) l' := by sorry
end MultiStoreAssort.Pricing
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.