Customers often wait in queues before being served. Since waiting is undesirable, customers may come back later (i.e., retry) when the queue is too long. However, retrial attempts can be costly due to transportation fees and service delays. This paper introduces a framework for rational retrial...

In a multi-server, single-queue symmetric capacity choice game, Gopalakrishnan et al. (2016) characterize the existence of a Nash equilibrium under a requirement on the servers’ capacity cost functions, which excludes some highly relevant cases where servers have ample discretion over their...

Although pooling queues offers in principle many operational benefits, these may not always be achieved in practice. One reason, observed in the empirical study by Song et al. (2015), relates to customer ownership. In this paper, we formalize these empirical observations by developing a...