Theorem 7: the no-search model under-estimates no-purchase demand for narrower and over-estimates it for deeper assortments
ProvedAssortSearch.HeurEq.theorem_7Consider the independent assortment search model with variants labelled by decreasing preference, , and . Take any assortment and the preferences estimated from it, . Then:
- for any narrower assortment , the no-search model under-estimates the no-purchase demand,
- for any deeper assortment , it over-estimates the no-purchase demand,
Here is the true no-purchase demand of the independent assortment model and is the no-search model's prediction with the estimated preferences. Because consumer search is more likely in narrower assortments but is not reflected in the estimates, a retailer using the no-search model over-estimates its demand with narrower assortments and under-estimates it with deeper ones.
Formalization Note Independent assortment model only (the paper dismisses the overlapping case with "the similar logic"). is allowed, where . The labelling (Antitone v) is the paper's standing convention of §3 and §5.1. is a free parameter.
import Mathlib import Definitions.Def_AssortSearch_HeurEq_Model
namespace AssortSearch.HeurEq
open RetailVariety.Structure
/-- Theorem 7 (p. 22), independent assortment model. Take any assortment `1 ≤ x ≤ n` and the
preferences `v̂(x)` estimated from it. With any narrower assortment `x' < x` the no-search model
under-estimates the no-purchase demand, `d_0(x') ≥ q_0^m(x' | v̂(x))`; with any deeper assortment
`x < x'' ≤ n` it over-estimates it, `d_0(x'') ≤ q_0^m(x'' | v̂(x))`. -/
theorem theorem_7 {n : ℕ} (lam : ℝ) (v : Fin n → ℝ) (v0 : ℝ)
(hv : ∀ i, 0 < v i) (hanti : Antitone v) (hv0 : 0 < v0) (hlam : 0 < lam)
(x : ℕ) (hx1 : 1 ≤ x) (hxn : x ≤ n) :
(∀ x' : ℕ, x' < x →
shareNoPurchase (estPref lam v v0 x) (estPrefNoPurchase lam v v0 x) x' ≤
demandNoPurchase lam v v0 x') ∧
(∀ x'' : ℕ, x < x'' → x'' ≤ n →
demandNoPurchase lam v v0 x'' ≤
shareNoPurchase (estPref lam v v0 x) (estPrefNoPurchase lam v v0 x) x'') := by sorry
end AssortSearch.HeurEq
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.