Showing 1 - 10 of 11,622
We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...
Persistent link: https://www.econbiz.de/10003341369
Persistent link: https://www.econbiz.de/10003974427
Persistent link: https://www.econbiz.de/10014302135
Persistent link: https://www.econbiz.de/10012107790
Simhon et al. (2016) proved that disclosing queue length to customers when the queue is shorter than some threshold and concealing the information otherwise cannot maximize the throughout of M/M/1 queues---when customers are familiar with the policy and the threshold. We show that said policy...
Persistent link: https://www.econbiz.de/10012855387
In this paper, we consider a single-server queuing system whose service quality is either high or low. The server, who knows the actual quality level, can signal such quality information to customers via revealing or concealing his queue length. Based on this and the observed queue length in the...
Persistent link: https://www.econbiz.de/10012823878
Consider a single-server service system with uncertain quality level (which is assumed to be binary). Both the server and the customers know the distribution of quality levels and are engaged in the following two-stage game. In the first stage, the server commits to a strategy (possibly mixed)...
Persistent link: https://www.econbiz.de/10012834252
Persistent link: https://www.econbiz.de/10012607204
We consider the problem of optimal information sharing in an unobservable single-server queue offering service at a fixed price to a Poisson arrival of delay-sensitive customers. The service provider observes the queue, and may share state information with arriving customers. The customers are...
Persistent link: https://www.econbiz.de/10012934075
Persistent link: https://www.econbiz.de/10011900071