Proof of Theorem 3.1, p. 8 — the tightness instance has CAP value at least αm/2
ProvedCustAssort.Value.thm31_cap_lowerassortment-optimizationcustomizationmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
In the paper's instance with products and types, parameter , and parameter , let . Then
This is the customized-revenue side of the explicit family showing that the factor in Theorem 3.1 has the right order.
Formalization Note The instance has and uses the paper's , , and for (zero otherwise).
Preamble
import Mathlib import Definitions.Def_CustAssort_Value_Setting
Formal statement
namespace CustAssort.Value
/-- The personalized-revenue lower bound in the proof of Theorem 3.1, page 8. -/
theorem thm31_cap_lower (m : ℕ) (a b : ℝ)
(hm : 1 ≤ m) (ha : 0 < a) (hb : 1 ≤ b) :
alpha a m * (m : ℝ) / 2 ≤ zCAP (thetaI a m) (vI b m) (revI a m) m := by sorry
end CustAssort.Value
Source
El Housni & Topaloglu, Joint Assortment Optimization and Customization under a Mixture of Multinomial Logit Models: Value of Personalized Assortments, SSRN 3830082 (version of December 7, 2021), p. 8, proof of Theorem 3.1, display z_CAP ≥ α·m/2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.