Proof of Proposition 6, p. 25 — for j > k*, Σ_{i≤j} P̄_i(α) = W(T)/(W(T)+1) ≥ Σ_{i≤j} P_i(T)
ProvedChoiceRM.MNL.mix_partial_sums_above_kstardiscrete-choicemultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
In the setting of the previous item (, , , with , solving (15), and the two-point weights , ), for every prefix length with ,
and the total purchase probability of is . In particular, at , .
Together with the previous item this verifies condition (ii) of Theorem 2 for the MNL model.
Formalization Note The paper's is written (λ is reserved in Lean). The prefix is complete n i with k < i ≤ n (0-based products Fin n).
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. 25: with `k*`, `θ` (the paper's `λ`) as in (15) and the
two-point weights, every prefix `A_i` with `i > k*` has `Σ_{j∈A_i} P̄_j(α) = W(T)/(W(T)+1) ≥
Σ_{j∈A_i} P_j(T)`, and the total `Σ_j P_j(T)` equals `W(T)/(W(T)+1)`. -/
theorem mix_partial_sums_above_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)) :
(∀ i : ℕ, k < i → i ≤ n →
∑ j ∈ complete n i, mixProb (mnl w) (twoPoint k θ) j =
(∑ l ∈ T, w l) / (∑ l ∈ T, w l + 1) ∧
∑ j ∈ complete n i, mnl w T j ≤ (∑ l ∈ T, w l) / (∑ l ∈ T, w l + 1)) ∧
∑ j, mnl w T j = (∑ l ∈ T, w l) / (∑ l ∈ T, w l + 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. 25, proof of Proposition 6, the display for j > k* and the case j = n
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.