Proof of Theorem 3.1, p. 8 — the earlier-product term is at most 2αb^m/a
ProvedCustAssort.Value.thm31_first_termassortment-optimizationcustomizationmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
On the paper's instance with and , for every assortment and customer type , the earlier-product term in equation (3.1) obeys
This is the first uniform contribution to the MMNL upper bound in Theorem 3.1.
Formalization Note The sum is empty for the first customer type. The natural-number exponents in Lean include the shift from the paper's one-based indices.
Preamble
import Mathlib import Definitions.Def_CustAssort_Value_Setting
Formal statement
namespace CustAssort.Value
/-- The first-term bound following equation (3.1), page 8. -/
theorem thm31_first_term (m : ℕ) (a b : ℝ) (ha : 2 ≤ a) (hb : 1 ≤ b)
(S : Finset (Fin m)) (j : Fin m) :
firstTerm a b S j ≤ 2 * alpha a m * b ^ m / a := 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, first-term display after (3.1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.