§5.1, p. 15 — the two optimal cutoffs satisfy 0 < c(λₕ) < c(λₗ) < c̄
ProvedAdvSellUpgrade.Online.cutoff_orderdelay-cutoffp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1priority-queuequeueing-economics
Let and , and let
be the optimal single-rate delay-sensitivity cutoff. Then
In words: the optimal cutoff lies strictly inside the cost range and is strictly smaller on a crowded day, so under state-dependent priority pricing some customers buy fast-track tickets in both states. The ordering makes the two-cutoff solution of the AS and AUS programs well ordered.
Formalization Note Stated under the full standing assumptions of the mission (Params.Standing); only and are relevant.
Preamble
import Mathlib import Definitions.Def_AdvSellUpgrade_Online_Setting
Formal statement
namespace AdvSellUpgrade.Online
/-- §5.1, p. 15, paragraph after Proposition 3: under the standing assumptions,
`0 < c(λh) < c(λl) < c̄`. -/
theorem cutoff_order (P : Params) (hP : P.Standing) :
0 < cFn P.mu P.cbar P.lamH ∧ cFn P.mu P.cbar P.lamH < cFn P.mu P.cbar P.lamL ∧
cFn P.mu P.cbar P.lamL < P.cbar := by sorry
end AdvSellUpgrade.Online
Source
Wang, Cao, Xie, Zhan, Advance Selling and Upgrading in Priority Queues, MSOM (2025), doi:10.1287/msom.2023.0410, p. 15, §5.1, paragraph after Proposition 3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.