Proposition 6, p. 23 — the MNL choice model has the nesting-by-fare-order property
ProvedChoiceRM.MNL.proposition_6Let be MNL preference weights (with no-purchase weight ), and let
be the MNL choice probabilities (14). Then this choice model has the nesting-by-fare-order property (Definition 4):
- the purchase probability is increasing in ; and
- for all values , the problem has an optimal solution that is a complete set , .
By the theory of §§2–3 of the paper, this means that under MNL demand the optimal single-resource revenue management policy opens fares in fare order: a convex combination of the two complete sets and dominates any incomplete set.
Formalization Note The paper states Proposition 6 as "the only nondominated sets are the complete sets , . Moreover, the optimal policy is a nested allocation policy where the nesting is by fare order." This item states what the proof (pp. 24–25) establishes, the two conditions of Theorem 2 / Definition 4. The literal first sentence is false when fares tie: with and , the incomplete set is nondominated; it is stated separately as proposition_6_nondominated_complete under strictly decreasing fares. The "Moreover" sentence about nested allocation policies (Definition 3) is not formalized. The empty set counts as complete; without it, condition 2 fails whenever all .
Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.
import Mathlib import Definitions.Def_RevenueManagement_singleResource import Definitions.Def_ChoiceRM_MNL_FareOrder import Definitions.Def_ChoiceRM_MNL_Models
namespace ChoiceRM.MNL
/-- Proposition 6, p. 23, in the form its proof establishes (pp. 24–25): the MNL choice model (14)
with positive weights has the nesting-by-fare-order property of Definition 4. -/
theorem proposition_6 {n : ℕ} (w : Fin n → ℝ) (hw : ∀ j, 0 < w j) :
HasFareOrderNesting (mnl w) := by sorry
end ChoiceRM.MNL
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.