Equilibrium in Queues Under Unknown Service Times and Service Value

In the operations research literature, the queue joining probability is monotonic decreasing in the queue length; the longer the queue, the fewer consumers join. Recent academic and empirical evidence indicates that queue-joining probabilities may not always be decreasing in the queue length. We provide a simple explanation for these nonmonotonic queue-joining strategies by relaxing the informational assumptions in Naor's model. Instead of imposing that the expected service time and service value are common knowledge, we assume that they are unknown to consumers, but positively correlated. Under such informational assumptions, the posterior expected waiting cost and service value increase in the observed queue length. As a consequence, we show that queue-joining equilibria may emerge for which the joining probability increases locally in the queue length. We refer to these as “sputtering equilibria.” We discuss when and why such sputtering equilibria exist for discrete as well as continuously distributed priors on the expected service time with positively correlated service value.

[1]  Yina Lu,et al.  Measuring the Effect of Queues on Customer Purchases , 2012, Manag. Sci..

[2]  Michael I. Norton,et al.  Think Customers Hate Waiting? Not So Fast... , 2011 .

[3]  Laurens G. Debo,et al.  Herding in Queues with Waiting Costs: Rationality and Regret , 2011, Manuf. Serv. Oper. Manag..

[4]  Michael I. Norton,et al.  The Labor Illusion: How Operational Transparency Increases Perceived Value , 2011, Manag. Sci..

[5]  Refael Hassin,et al.  Equilibrium Threshold Strategies: The Case of Queues with Priorities , 1997, Oper. Res..

[6]  Senthil K. Veeraraghavan,et al.  Signaling by Price in a Congested Environment , 2012 .

[7]  Gad Allon,et al.  Bounded Rationality in Service Systems , 2013, Manuf. Serv. Oper. Manag..

[8]  Eitan Zemel,et al.  Nash and correlated equilibria: Some complexity considerations , 1989 .

[9]  Moshe Haviv,et al.  Reneging from Processor Sharing Systems and Random Queues , 1990, Math. Oper. Res..

[10]  Yina Lu,et al.  Measuring the Effect of Queues on Customer Purchases , 2012 .

[11]  Stephen F. Smith,et al.  Design and Analysis of Diagnostic Service Centers , 2010, Manag. Sci..

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

[13]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[14]  Peng Sun,et al.  Diagnostic Accuracy Under Congestion , 2013, Manag. Sci..

[15]  E. Anderson Linear Programming In Infinite Dimensional Spaces , 1970 .

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

[17]  J. Mold,et al.  The Law of Diminishing Returns in Clinical Medicine: How Much Risk Reduction is Enough? , 2010, The Journal of the American Board of Family Medicine.

[18]  Senthil K. Veeraraghavan,et al.  Quality-Speed Conundrum: Trade-offs in Customer-Intensive Services , 2011, Manag. Sci..

[19]  Eric Maskin,et al.  Markov Perfect Equilibrium: I. Observable Actions , 2001, J. Econ. Theory.

[20]  Laurens G. Debo,et al.  Inferring Quality from a Queue , 2008 .

[21]  Wallace J. Hopp,et al.  Operations Systems with Discretionary Task Completion , 2006, Manag. Sci..

[22]  Michael D. Giebelhausen,et al.  Worth waiting for: increasing satisfaction by making consumers wait , 2011 .

[23]  Laurens G. Debo,et al.  Signaling Quality Via Queues , 2010, Manag. Sci..

[24]  Sampath Rajagopalan,et al.  Speed-Quality Trade-Offs in a Dynamic Model , 2014, Manuf. Serv. Oper. Manag..

[25]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[26]  Avishai Mandelbaum,et al.  A model for rational abandonments from invisible queues , 2000, Queueing Syst. Theory Appl..