Proof of Theorem 3, case λ*t > n — J^FP(n,t) ≥ np⁰(1 − 1/(2√n)) = r⁰t(1 − 1/(2√n))
ProvedGVRPricing.FixedPrice.fp_scarce_boundfixed-pricep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1performance-guaranteerevenue-management
Let be a regular demand function, a stock and a horizon with , the case in which items are scarce. The fixed-price heuristic then uses the run-out price , and with ,
This is one of the two cases of Theorem 3. Compared with (Proposition 2), it gives the ratio .
Formalization Note is the expected revenue of the constant-price policy at , in ; the bound is stated for its embedding. The hypothesis makes defined; with is the page's case.
Preamble
import Mathlib import Definitions.Def_GVRPricing_FixedPrice_Model import Definitions.Def_GVRPricing_FixedPrice_SalesProcess open MeasureTheory ProbabilityTheory Set open scoped ENNReal
Formal statement
namespace GVRPricing.FixedPrice
/-- **Proof of Theorem 3, scarce case** (p. 1008). If `λ* t > n ≥ 1` (`t > 0`), the fixed-price
heuristic uses the run-out price `p⁰ = p(n/t)` and
`J^FP(n, t) ≥ n p⁰ (1 − 1/(2√n)) = r⁰ t (1 − 1/(2√n))` with `r⁰ = r(n/t)`. -/
theorem fp_scarce_bound (M : Model) (n : ℕ) (t : ℝ) (hn : 1 ≤ n) (ht : 0 < t)
(h : (n : ℝ) < M.lstar * t) :
ENNReal.ofReal (n * M.p (n / t) * (1 - 1 / (2 * Real.sqrt n))) ≤ fpValue M n t ∧
n * M.p (n / t) * (1 - 1 / (2 * Real.sqrt n)) =
M.r (n / t) * t * (1 - 1 / (2 * Real.sqrt n)) := by sorry
end GVRPricing.FixedPrice
Source
Gallego, van Ryzin, Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons, Management Science 40(8) (1994), p. 1008 (PDF 10), §3.3, Proof of Theorem 3, display after (18)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.