When Queuening is Better than Push and Shove
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.
|Date of creation:||May 2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Fax: +49 228 73 6884
Web page: http://www.bgse.uni-bonn.de
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Myerson, Roger B. & Satterthwaite, Mark A., 1983.
"Efficient mechanisms for bilateral trading,"
Journal of Economic Theory,
Elsevier, vol. 29(2), pages 265-281, April.
- MANIQUET, François, .
"A characterization of the Shapley value in queueing problems,"
CORE Discussion Papers RP
-1662, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
- Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-72, August.
- Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
- Tayfun Sönmez & M. Utku Ünver, 2001.
"House Allocation with Existing Tenants: An Equivalence,"
Game Theory and Information
0112002, EconWPA, revised 26 Sep 2002.
- Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
- Atila Abdulkadiroglu & Tayfun Sönmez, 2003.
"School Choice: A Mechanism Design Approach,"
American Economic Review,
American Economic Association, vol. 93(3), pages 729-747, June.
- Manipushpak Mitra & Roland Hain, 2001.
"Simple Sequencing Problems with Interdependent Costs,"
Bonn Econ Discussion Papers
bgse20_2001, University of Bonn, Germany.
- Hain, Roland & Mitra, Manipushpak, 2004. "Simple sequencing problems with interdependent costs," Games and Economic Behavior, Elsevier, vol. 48(2), pages 271-291, August.
- Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
- Manipushpak Mitra, 2000.
"Mechanism Design in Queueing Problems,"
Econometric Society World Congress 2000 Contributed Papers
1301, Econometric Society.
- Jeroen Suijs, 1996. "On incentive compatibility and budget balancedness in public decision making," Review of Economic Design, Springer, vol. 2(1), pages 193-209, December.
- Roger B. Myerson, 1978. "Optimal Auction Design," Discussion Papers 362, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Kittsteiner, Thomas & Moldovanu, Benny, 2004.
"Priority Auctions and Queue Disciplines that Depend on Processing Time,"
Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems
5, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
- Manipushpak Mitra, 2000.
"Achieving the First Best in Sequencing Problems,"
Bonn Econ Discussion Papers
bgse11_2001, University of Bonn, Germany.
- MISHRA, Debasis & RANGARAJAN, Bharath, 2005.
"Cost sharing in a job scheduling problem,"
CORE Discussion Papers
2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
- Pettersen Strandenes, Siri & Wolfstetter, Elmar, 2005. "Efficient (re-)scheduling: An auction approach," Economics Letters, Elsevier, vol. 89(2), pages 187-192, November.
When requesting a correction, please mention this item's handle: RePEc:bon:bonedp:bgse10_2006. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (BGSE Office)
If references are entirely missing, you can add them using this form.