Equation (3.1), p. 8 — split weighted MNL revenue by the diagonal product
ProvedCustAssort.Value.eq_3_1assortment-optimizationcustomizationmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
On the paper's instance with and , let be any assortment and any customer type. Separate the numerator of into products and the possible product . Equation (3.1) is
This decomposition isolates the two contributions bounded separately in the proof of Theorem 3.1.
Formalization Note firstTerm and secondTerm are the two displayed fractions. The paper's indices start at one; Lean's start at zero, so is i < j.
Preamble
import Mathlib import Definitions.Def_CustAssort_Value_Setting
Formal statement
namespace CustAssort.Value
/-- Equation (3.1), page 8: the weighted type revenue splits before and at `j`. -/
theorem eq_3_1 (m : ℕ) (a b : ℝ) (ha : 0 < a) (hb : 0 ≤ b)
(S : Finset (Fin m)) (j : Fin m) :
thetaI a m j * CustAssort.AugGreedy.rev (vI b m) (revI a m) j S =
firstTerm a b S j + secondTerm a b S j := 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, (3.1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.