An impossibility in sequencing problems

Ramaekers, Eve;Kayi, Çağatay
(2008)

Files

No attached file found for this publication.

Details

Authors
  • Ramaekers, EveUCLouvain
    Author
  • Kayi, Çağatay
    Author
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Ramaekers, E., & Kayi, Ç. (2008). An impossibility in sequencing problems (METEOR Research Memorandum 40). https://hdl.handle.net/2078.5/85440