Debo, LaurensVeeraraghavan, Senthil K2023-05-222014-08-242014-01-012017-08-18https://repository.upenn.edu/handle/20.500.14332/34180In 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).https://doi.org/10.1287/opre.2013.1232queueing gamesthreshold policiesnonmonotone queue joiningrandomizationBusinessFinance and Financial ManagementArticle