Theorem 5 (common margin): under independent-assortment search, is quasi-convex on
DisprovedAssortSearch.SearchQC.theorem_5Consider the independent-assortment search model of Cachon, Terwiesch and Xu. There are variants with preferences and a no-purchase option with preference ; is the search parameter; every variant earns the same margin ; and the operational cost is concave and increasing on and twice continuously differentiable on . Variant 's demand in an assortment is
and its profit is .
Fix an assortment and a variant , and give a variable preference . Let be variant 's profit in , let , and let
be the change in total profit from adding . Then is quasi-convex on : for all and ,
Quasi-convexity means that adding a variant is most profitable at an extreme of its popularity, which is what places the optimal assortment among the popular assortments, the sets of the most preferred variants.
Formalization Note The paper's model allows a margin per variant. The theorem is stated with one margin for every variant, including , as the proof's displays (7)–(9) do; with unequal margins the statement is false (one variant with , , , , , gives an that rises, falls and rises again). The paper assumes only "concave and increasing"; twice continuous differentiability on is added because the proof uses and . is a free parameter (every real gives one). Quasi-convexity is Mathlib's QuasiconvexOn ℝ (Set.Ici 0). At , .
import Mathlib import Definitions.Def_AssortSearch_SearchQC_Model
namespace AssortSearch.SearchQC
/-- Theorem 5 (p. 14), common-margin case: under independent-assortment search, with one margin
`m` for every variant and a concave, increasing, twice continuously differentiable cost `c`,
`h^si(v_j) = π_j^si(v_j) - L^si(v_j)` is quasi-convex in `v_j` on `[0, ∞)`. `lam` is
`λ = exp[-(Ū/μ + γ)]`, taken as a free positive parameter. -/
theorem theorem_5 {n : ℕ} (v : Fin n → ℝ) (v0 lam m : ℝ) (c : ℝ → ℝ)
(S : Finset (Fin n)) (j : Fin n)
(hv : ∀ i, 0 < v i) (hv0 : 0 < v0) (hlam : 0 < lam) (hj : j ∉ S)
(hconc : ConcaveOn ℝ (Set.Icc 0 1) c) (hmono : MonotoneOn c (Set.Icc 0 1))
(hsmooth : ContDiffOn ℝ 2 c (Set.Ioo 0 1)) :
QuasiconvexOn ℝ (Set.Ici 0) (hSI m c lam v v0 S j) := by sorry
end AssortSearch.SearchQC
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.