Proof of Proposition 6, p. 24 — for j ≤ k*, P̄_j(α) = w_j/(Σ_{i∈T} w_i + 1) ≥ P_j(T)
ProvedChoiceRM.MNL.mix_ge_below_kstardiscrete-choicemultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
Let , , and let be the MNL probabilities (14). Let , let satisfy , and let satisfy (15). With the convex weights , and otherwise, and , every product satisfies
Summed over , this gives the majorization inequalities of Theorem 2 (ii) for the prefixes with .
Formalization Note The paper's is written (λ is reserved in Lean). Products are Fin n; the paper's (1-based) is j.val < k (0-based). The weights are twoPoint k θ on the index set .
Preamble
import Mathlib import Definitions.Def_RevenueManagement_singleResource import Definitions.Def_ChoiceRM_MNL_FareOrder import Definitions.Def_ChoiceRM_MNL_Models
Formal statement
namespace ChoiceRM.MNL
/-- Proof of Proposition 6, p. 24: with `k*`, `θ` (the paper's `λ`) as in (15) and the
two-point weights `α_{k*} = θ`, `α_{k*+1} = 1 − θ`, every fare `j ≤ k*` (0-based `j < k`) has
`P̄_j(α) = w_j / (W(T) + 1) ≥ P_j(T)`. -/
theorem mix_ge_below_kstar {n : ℕ} (w : Fin n → ℝ) (hw : ∀ j, 0 < w j)
(T : Finset (Fin n)) (k : ℕ) (hk : k < n)
(hlo : ∑ i ∈ complete n k, w i ≤ ∑ i ∈ T, w i)
(hhi : ∑ i ∈ T, w i < ∑ i ∈ complete n (k + 1), w i)
(θ : ℝ) (hθ0 : 0 ≤ θ) (hθ1 : θ ≤ 1)
(h15 : θ * ((∑ i ∈ complete n k, w i) / (∑ i ∈ complete n k, w i + 1)) +
(1 - θ) * ((∑ i ∈ complete n (k + 1), w i) /
(∑ i ∈ complete n (k + 1), w i + 1)) =
(∑ i ∈ T, w i) / (∑ i ∈ T, w i + 1)) :
∀ j : Fin n, j.val < k →
mixProb (mnl w) (twoPoint k θ) j = w j / (∑ i ∈ T, w i + 1) ∧
mnl w T j ≤ w j / (∑ i ∈ T, w i + 1) := by sorry
end ChoiceRM.MNL
Source
Talluri, van Ryzin, Revenue management under a general discrete choice model of consumer behavior, working paper of October 21, 2001 (UPF Economics Working Paper 533; published Management Science 50(1), 2004, DOI 10.1287/mnsc.1030.0147), p. 24, proof of Proposition 6, eq. (16) and the display for j ≤ k*
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.