An Impossibility in Sequencing Problems

A set of agents with different waiting costs have to receive a service of different length of time from a single provider which can serve only one agent at a time. One needs to form a queue and set up monetary transfers to compensate the agents who have to wait. We prove that no rule satisfies efficiency of queues and coalitional strategy-proofness.

Blogs Publicados