Lemma 2, p. 12 — largest optimal index decreases with marginal value
ProvedChoiceRM.Policy.lemma_2discrete-choicedynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
For an ordered family of nondominated sets, let be the greatest index maximizing . If , then
The greatest-index convention resolves ties and is the one used by Theorem 1. In the dynamic program, is the marginal capacity value .
Formalization Note The statement uses the real parameter introduced in the paper's proof of Lemma 2. Its two maximizers are required to be the greatest among ties.
Preamble
import Mathlib import Definitions.Def_RevenueManagement_singleResource import Definitions.Def_ChoiceRM_Policy_Dominance import Definitions.Def_ChoiceRM_Policy_Value
Formal statement
namespace ChoiceRM.Policy
open RevenueManagement
/-- Lemma 2 (p. 12): the greatest optimal index decreases with the marginal value. -/
theorem lemma_2 {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)))
(v v' : ℝ) (hv : 0 ≤ v) (hvv' : v ≤ v') (k k' : Fin m)
(hk : IsLargestMaximizer P r Sq v k)
(hk' : IsLargestMaximizer P r Sq v' k') :
k' ≤ k := 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), pp. 12–13, Lemma 2 and proof
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.