Pricing and priority auctions in queueing systems with a generalized delay cost structure

被引:123
|
作者
Afèche, P
Mendelson, H
机构
[1] Northwestern Univ, JL Kellogg Grad Sch Management, Evanston, IL 60208 USA
[2] Stanford Univ, Grad Sch Business, Stanford, CA 94305 USA
关键词
auctions; congestion; delay cost; incentive compatibility; pricing; priority; queueing; quality of service; revenue management; scheduling; service differentiation;
D O I
10.1287/mnsc.1030.0156
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies alternative price-service mechanisms for a provider that serves customers whose delay cost depends on their service valuations. We propose a generalized delay cost structure that augments the standard additive model with a multiplicative component, capturing the interdependence between delay cost and values. We derive and compare the revenue-maximizing and socially optimal equilibria under uniform pricing, preemptive, and nonpreemptive priority auctions with an admission price. We find that the delay cost structure has a paramount effect on system behavior. The classical result that the revenue-maximizing admission price is higher and the utilization lower than is socially optimal can be reversed under our generalized structure, and we identify the conditions driving this reversal under each mechanism. We show that the conditional bid equilibria are unique and induce the socially optimal allocations. The auctions yield gains in system net value and provider profit over uniform pricing, which are dramatically larger for the preemptive mechanism. Both auctions perform better under multiplicative compared to additive delay costs. The highest-value customers always gain under the preemptive, but may lose under the nonpreemptive auction. The lowest-value customers always gain in either auction.
引用
收藏
页码:869 / 882
页数:14
相关论文
共 50 条
  • [31] Profit maximization and cost balancing in queueing systems
    Hassin, Refael
    QUEUEING SYSTEMS, 2022, 100 (3-4) : 429 - 431
  • [32] Multidimensional analogs of the Kendall eiquation for priority queueing systems: Computational aspects
    Mishkoy, Gh. K.
    Rykov, V. V.
    Giordano, S.
    Bejan, A. Iu.
    AUTOMATION AND REMOTE CONTROL, 2008, 69 (06) : 980 - 992
  • [33] Priority queueing systems: from probability generating functions to tail probabilities
    Tom Maertens
    Joris Walraevens
    Herwig Bruneel
    Queueing Systems, 2007, 55 : 27 - 39
  • [34] Queue-length distributions for multi-priority queueing systems
    Daigle, JN
    Roughan, M
    IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, : 641 - 648
  • [35] Large computer systems and networks as closed queueing networks with priority scheduling
    Oniszczuk, Walenty
    Archiwum Automatyki i Telemechaniki, 1988, 33 (01): : 165 - 181
  • [36] Performance analysis of priority queueing systems using timed Petri nets
    Strzeciwilk, Dariusz
    Pekala, Robert
    Kwater, Tadeusz
    PROCEEDINGS OF 19TH INTERNATIONAL CONFERENCE COMPUTATIONAL PROBLEMS OF ELECTRICAL ENGINEERING, 2018,
  • [37] Multidimensional analogs of the kendall equation for priority queueing systems: computational aspects
    Gh. K. Mishkoy
    V. V. Rykov
    S. Giordano
    A. Iu. Bejan
    Automation and Remote Control, 2008, 69 : 980 - 992
  • [38] Correction to: Multi-server queueing systems with multiple priority classes
    Mor Harchol-Balter
    Takayuki Osogami
    Alan Scheller-Wolf
    Adam Wierman
    Queueing Systems, 2021, 99 : 397 - 398
  • [39] Priority queueing systems: from probability generating functions to tail probabilities
    Maertens, Tom
    Walraevens, Joris
    Bruneel, Herwig
    QUEUEING SYSTEMS, 2007, 55 (01) : 27 - 39
  • [40] Social Interactions in Queueing Systems: Pricing Decision with Reference Time Effect
    Jiang, Tao
    Zhang, Zitong
    Chai, Xudong
    METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2025, 27 (01)