Lemma 1, p. 12 — higher-indexed winner persists at lower values
ProvedChoiceRM.Policy.lemma_1discrete-choicedynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
Take two nondominated sets indexed in nondecreasing purchase-probability order. If and set strictly beats set at , then it strictly beats it at every :
This comparison is the order step used to control changes in the optimal index.
Preamble
import Mathlib import Definitions.Def_RevenueManagement_singleResource import Definitions.Def_ChoiceRM_Policy_Dominance
Formal statement
namespace ChoiceRM.Policy
open RevenueManagement
/-- Lemma 1 (p. 12): a higher indexed set that wins at `v₀` wins at every lower `v`. -/
theorem lemma_1 {n m : ℕ} (P : Finset (Fin n) → Fin n → ℝ) (r : Fin n → ℝ)
(Sq : Fin m → Finset (Fin n)) (hnd : ∀ k, IsNondominated P r (Sq k))
(hmono : Monotone (fun k => purchaseProb P (Sq k)))
(k l : Fin m) (hkl : k < l) (v₀ : ℝ) (hv₀ : 0 ≤ v₀)
(h : expRevenue P r (Sq k) - purchaseProb P (Sq k) * v₀ <
expRevenue P r (Sq l) - purchaseProb P (Sq l) * v₀) :
∀ v : ℝ, v ≤ v₀ →
expRevenue P r (Sq k) - purchaseProb P (Sq k) * v <
expRevenue P r (Sq l) - purchaseProb P (Sq l) * v := by sorry
end ChoiceRM.Policy
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. 12, Lemma 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.