Lemma 5, p. 24 — a convex combination matching f(y) = y/(y+1) also matches g(y) = 1/(y+1)
ProvedChoiceRM.MNL.lemma_5discrete-choicemultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
Let and . Suppose and satisfy
Then
In the proof of Proposition 6 this transfers the choice of the weight , made to match the total purchase probability of an incomplete set (equation (15)), to the individual MNL probabilities (equation (16)).
Formalization Note The paper's is written (λ is reserved in Lean). The page says " and are nonnegative numbers"; nonnegativity of gives that of .
Preamble
import Mathlib
Formal statement
namespace ChoiceRM.MNL
/-- Lemma 5, p. 24 (the paper's `λ` is written `θ`): with `f(y) = y/(y+1)` and `g(y) = 1/(y+1)`,
if `0 ≤ y₁ ≤ y₂ ≤ y₃`, `θ ≥ 0` and `θ f(y₁) + (1 − θ) f(y₃) = f(y₂)`, then
`θ g(y₁) + (1 − θ) g(y₃) = g(y₂)`. -/
theorem lemma_5 (y₁ y₂ y₃ θ : ℝ) (h0 : 0 ≤ y₁) (h12 : y₁ ≤ y₂) (h23 : y₂ ≤ y₃) (hθ : 0 ≤ θ)
(h : θ * (y₁ / (y₁ + 1)) + (1 - θ) * (y₃ / (y₃ + 1)) = y₂ / (y₂ + 1)) :
θ * (1 / (y₁ + 1)) + (1 - θ) * (1 / (y₃ + 1)) = 1 / (y₂ + 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, Lemma 5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.