Proposition 2, p. 11 — dominated sets can be excluded
ProvedChoiceRM.Policy.proposition_2discrete-choicedynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
At a decision stage with periods and units remaining, put . Under a proper choice model, nonnegative fares and an arrival probability :
- If and , no dominated set maximizes the Bellman stage objective.
- If , at least one nondominated set maximizes that objective.
is the objective in both clauses. The result justifies reducing stage optimization to the nondominated frontier.
Formalization Note Strict positivity of is needed only in the first clause: with zero arrival probability every set is optimal, including dominated ones.
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
/-- Proposition 2 (p. 11), with positive arrival probability required only in its
first clause. -/
theorem proposition_2 {n : ℕ} (lam : ℝ) (hlam0 : 0 ≤ lam) (hlam1 : lam ≤ 1)
(P : Finset (Fin n) → Fin n → ℝ) (hP : IsChoiceModel P)
(r : Fin n → ℝ) (hr : ∀ j, 0 ≤ r j) (t x : ℕ) (ht : 1 ≤ t) (hx : 1 ≤ x) :
((0 < lam → 0 < deltaV lam P r (t - 1) x →
∀ T, IsDominated P r T → ¬ IsOptimalOffer lam P r t x T) ∧
(deltaV lam P r (t - 1) x = 0 →
∃ T, IsNondominated P r T ∧ IsOptimalOffer lam P r t x T)) := 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. 11, Proposition 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.