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...

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...

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)...

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...

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...

We investigate a server's best queue disclosure strategy in a single-server service system with an uncertain quality level (which is assumed to be binary). We consider this problem from the perspective of a Bayesian persuasion game. The server first commits to a possibly mixed strategy stating...