Lemma 3.1 — for i ∉ A: rᵢ > f(A, v) ⟺ f(A ∪ {i}, v) > f(A, v) ⟺ rᵢ > f(A ∪ {i}, v)
ProvedRobustMNL.Static.adding_product_iffassortment-optimizationmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
When is adding a product beneficial? Let , let be an assortment and let . Then the following three statements are equivalent:
- ;
- ;
- .
In words: adding product strictly increases the expected revenue exactly when its revenue exceeds the current expected revenue, and then it also exceeds the new one. Lemma 3.1 drives the exchange arguments behind the structural results of the paper (Theorems 3.2 and 3.6).
Formalization Note The equivalence is stated as List.TFAE of the three statements. Products are Fin n (Lean index is the paper's product ); revenues are arbitrary reals.
Preamble
import Mathlib import Definitions.Def_RobustMNL_Static_Model
Formal statement
namespace RobustMNL.Static
theorem adding_product_iff {n : ℕ} (r : Fin n → ℝ) (p : ℝ × (Fin n → ℝ)) (hp : IsPos p)
(A : Finset (Fin n)) (i : Fin n) (hi : i ∉ A) :
List.TFAE [r i > rev r A p, rev r (insert i A) p > rev r A p,
r i > rev r (insert i A) p] := by sorry
end RobustMNL.Static
Source
Rusmevichientong, Topaloglu, Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model, Operations Research (2012), doi:10.1287/opre.1120.1063, authors' manuscript of 20 Sep 2011, Lemma 3.1, p. 6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.