Theorem 3.2 (restated) — revenue-ordered assortments are robust: S*(V) = {i : rᵢ > Z*(V)}
ProvedRobustMNL.Dynamic.revenue_ordered_robustLet be a compact nonempty uncertainty set and let be arbitrary real revenues. An assortment is an optimal assortment of the Robust Logit problem with the smallest cardinality among optimal assortments if and only if
In particular the threshold set is optimal, and it is the unique optimal assortment of smallest cardinality.
The robust assortment is therefore revenue-ordered, exactly as in the case of known parameters. In Section 4 this is applied period by period with revenues .
Formalization Note The paper writes ""; the parameter vector has components and the standing assumption of Sec. 3 is a compact , which is stated here (with nonemptiness, implicit in ). The theorem is stated for arbitrary real revenues; the paper's ordering is "without loss of generality", is used by no step of the proof, and Section 4 needs revenues that may be negative. is the predicate IsSmallestOptimal; the "↔" asserts both that every such is the threshold set and that the threshold set is one. This restates RobustMNL.Static.revenue_ordered_robust of the companion mission verbatim up to namespace.
import Mathlib import Definitions.Def_RobustMNL_Dynamic_StaticModel
namespace RobustMNL.Dynamic
theorem revenue_ordered_robust {n : ℕ} (r : Fin n → ℝ) (V : Set (ℝ × (Fin n → ℝ)))
(hV : IsCompact V) (hne : V.Nonempty) (hpos : ∀ p ∈ V, RobustMNL.Static.IsPos p) (S : Finset (Fin n)) :
RobustMNL.Static.IsSmallestOptimal V r S ↔ S = Finset.univ.filter (fun i => RobustMNL.Static.Zstar V r < r i) := by sorry
end RobustMNL.Dynamic
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.