When Queueing is Better than Push and Shove
Alex Gerskov and
No 10/2006, Bonn Econ Discussion Papers from University of Bonn, Bonn Graduate School of Economics (BGSE)
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 existing property rights for the service are small enough to enable trade between the agents. In particular, we show on the one hand that no queue under a fully deterministic service schedule such as first-come, first-serve can be dissolved efficiently and meet our requirements. If, on the other hand, the alternative is service anarchy (ie. a random queue), every existing queue can be transformed into an efficient order.
Keywords: Scheduling; Queueing; Mechanism design (search for similar items in EconPapers)
JEL-codes: D82 D44 C72 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Journal Article: When queueing is better than push and shove (2010)
Working Paper: When queueing is better than push and shove (2006)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:zbw:bonedp:102006
Access Statistics for this paper
More papers in Bonn Econ Discussion Papers from University of Bonn, Bonn Graduate School of Economics (BGSE) Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().