Proposition 1 — avoid-the-crowd buying behavior
ProvedQueueScalp.Entry.proposition_1customer-behaviordelayp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queue-scalping
For a single queue-scalper under the head-queueing rule, let be the throughput and let be the fraction of joining customers who buy. The difference between nonbuyer and buyer expected delays is
The function is strictly decreasing on : a higher buying fraction reduces an individual's delay gain from buying. This is the paper's avoid-the-crowd property.
Formalization Note The strict statement uses ; at zero throughput the difference is constant. The paper's capacity, valuation, and cost assumptions are carried in Standing.
Preamble
import Mathlib import Definitions.Def_QueueScalp_Entry_Model
Formal statement
namespace QueueScalp.Entry
theorem proposition_1 (P : Params) (hS : P.Standing) (lam : ℝ)
(hlam : 0 < lam) (hstable : lam < P.mu) :
(∀ q ∈ Set.Icc (0 : ℝ) 1,
D P.mu lam q = (lam / P.mu) ^ 2 / (P.mu - lam + lam * q)) ∧
StrictAntiOn (D P.mu lam) (Set.Icc (0 : ℝ) 1) := by sorry
end QueueScalp.Entry
Source
Yang, Wang & Cui, A Model of Queue-Scalping, authors' manuscript (Management Science 2021, doi:10.1287/mnsc.2020.3865), p. 10 (PDF 10), Proposition 1; proof, Online Appendix p. 1 (PDF 34)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.