Theorem 3.7 β additive incremental revenues lead to a larger robust assortment: S*(π±) β S*_Ξ΄(π±)
ProvedRobustMNL.Static.incremental_revenue_largerAdditive incremental revenues lead to a larger robust assortment. Let be compact and nonempty and let . Let be an optimal assortment of smallest cardinality for the Robust Logit problem in which every revenue is replaced by . Then
As the opportunity cost of not making a sale grows, the robust assortment grows. The paper uses this to compare the assortments of its dynamic model at different times and inventory levels.
Formalization Note The inclusion holds for every pair of smallest-cardinality optimal assortments (revenues ) and (revenues ). The robust problem with revenues is the Robust Logit problem of the mission with the revenue vector fun i => r i + Ξ΄, since is at those revenues. The set is compact, nonempty and in , the standing assumption of Sec. 3. Revenues are arbitrary reals; products are Fin n.
import Mathlib import Definitions.Def_RobustMNL_Static_Model
namespace RobustMNL.Static
theorem incremental_revenue_larger {n : β} (r : Fin n β β) (V : Set (β Γ (Fin n β β)))
(hV : IsCompact V) (hne : V.Nonempty) (hpos : β p β V, IsPos p) (Ξ΄ : β) (hΞ΄ : 0 β€ Ξ΄)
(S S' : Finset (Fin n)) (hS : IsSmallestOptimal V r S)
(hS' : IsSmallestOptimal V (fun i => r i + Ξ΄) S') : S β S' := by sorry
end RobustMNL.Static
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.