Pricing in Queues without Demand Information

We consider revenue and social optimization in an M/M/1 queue with price and delay sensitive customers, and study the performance of uninformed pricing that does not require any arrival rate information. We formally characterize the optimal uninformed price and its performance relative to pricing with precise arrival rate knowledge. For uniformly distributed customer valuations, under a large set of parameters, we find that uninformed prices can capture more than 99% of the optimal revenue and more than 85% of the optimal social welfare. We further prove that the performance of uninformed prices improves as the customers become more delay sensitive and is always better under revenue optimization compared with social optimization.

[1]  P. Naor The Regulation of Queue Size by Levying Tolls , 1969 .

[2]  S. C. Littlechild,et al.  Optimal arrival rate in a simple queueing system , 1974 .

[3]  Haim Mendelson,et al.  Pricing computer services: queueing effects , 1985, CACM.

[4]  P. Kolesar,et al.  The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals , 1991 .

[5]  W. Whitt The pointwise stationary approximation for M 1 / M 1 / s , 1991 .

[6]  G. Gallego,et al.  The Distribution Free Newsboy Problem: Review and Extensions , 1993 .

[7]  G. Ryzin,et al.  Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .

[8]  John N. Tsitsiklis,et al.  Congestion-dependent pricing of network services , 2000, TNET.

[9]  Refael Hassin,et al.  To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[10]  Moshe Haviv,et al.  Price and delay competition between two service providers , 2003, Eur. J. Oper. Res..

[11]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Inventory Theory , 2006, Oper. Res..

[12]  Min-Chiang Wang,et al.  Expected Value of Distribution Information for the Newsvendor Problem , 2006, Oper. Res..

[13]  Andrew E. B. Lim,et al.  Relative Entropy, Exponential Utility, and Robust Dynamic Pricing , 2007, Oper. Res..

[14]  Georgia Perakis,et al.  Regret in the Newsvendor Model with Partial Information , 2008, Oper. Res..

[15]  Yingjie Lan,et al.  Revenue Management with Limited Demand Information , 2008, Manag. Sci..

[16]  Costis Maglaras,et al.  Monopoly pricing with limited demand information , 2008 .

[17]  Maurice Queyranne,et al.  Toward Robust Revenue Management: Competitive Analysis of Online Booking , 2009, Oper. Res..

[18]  Omar Besbes,et al.  Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms , 2009, Oper. Res..

[19]  Sunil Kumar,et al.  Exploiting Market Size in Service Systems , 2010, Manuf. Serv. Oper. Manag..

[20]  Pnina Feldman,et al.  Dynamic versus Static Pricing in the Presence of Strategic Consumers , 2010 .

[21]  Georgia Perakis,et al.  Robust Controls for Network Revenue Management , 2010, Manuf. Serv. Oper. Manag..

[22]  Benjamin Van Roy,et al.  Dynamic Pricing with a Prior on Market Response , 2010, Oper. Res..

[23]  Omar Besbes,et al.  On the Minimax Complexity of Pricing in a Changing Environment , 2011, Oper. Res..

[24]  Pnina Feldman,et al.  Pricing Services Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions? , 2011, Manuf. Serv. Oper. Manag..

[25]  Baris Ata,et al.  Bayesian Dynamic Pricing in Queueing Systems with Unknown Delay Cost Characteristics , 2013, Manuf. Serv. Oper. Manag..