pp. 19–20, after Theorem 2 — a majorizing mixture of complete sets earns at least as much as T
ProvedChoiceRM.FareOrder.mixture_dominatesThroughout, is the set of fare products, indexed in fare order . A choice model assigns to every offer set and product a purchase probability , with for and (the no-purchase probability is ). The complete sets are for , with ; every other set is incomplete.
Let and let with be weights such that satisfies
Then for every ,
This is the paper's direct explanation of why the majorization condition suffices: the convex combination of complete sets produces at least as much value in (9) as , for the same probability of purchase.
Formalization Note Fare is the element of Fin n; the order is Antitone x; is complete n k; the choice-model axioms are IsChoiceModel P (platform definition RevenueManagement_singleResource) together with SupportedOn P ( off , the model's own convention on p. 5). Complete sets are indexed by , so counts as complete and the weights live on sets. The page indexes the weights by ; the paper notes on p. 21 that Theorem 2 holds for any specified family of sets, and with included the property is the one the paper's Propositions 5 and 6 need (for MNL and all , the unique optimum of (9) is ).
import Mathlib import Definitions.Def_RevenueManagement_singleResource import Definitions.Def_ChoiceRM_FareOrder_FareOrder
namespace ChoiceRM.FareOrder
open RevenueManagement
/-- pp. 19–20, after Theorem 2: if the mixture `P̄(α)` of complete sets has prefix sums at least
those of `P(T)` and the same total, then for every `x_1 ≥ … ≥ x_n` the mixture earns at least
as much as `T` in (9). -/
theorem mixture_dominates {n : ℕ} (P : Finset (Fin n) → Fin n → ℝ)
(hP : IsChoiceModel P) (hsupp : SupportedOn P) (T : Finset (Fin n))
(α : Fin (n + 1) → ℝ) (hα0 : ∀ k, 0 ≤ α k) (hα1 : ∑ k, α k = 1)
(hpre : ∀ i, i < n → ∑ j ∈ complete n i, P T j ≤ ∑ j ∈ complete n i, mixProb P α j)
(htot : ∑ j, mixProb P α j = ∑ j, P T j)
(x : Fin n → ℝ) (hx : Antitone x) :
fareValue P x T ≤ ∑ k : Fin (n + 1), α k * fareValue P x (complete n k.val) := by sorry
end ChoiceRM.FareOrder
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.