When queueing is better than push and shove
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal International Journal of Game Theory.
Volume (Year): 39 (2010)
Issue (Month): 3 (July)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm
Other versions of this item:
- Gershkov, Alex & Schweinzer, Paul, 2006. "When queueing is better than push and shove," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 144, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Alex Gershkov & Paul Schweinzer, 2006. "When Queuening is Better than Push and Shove," Bonn Econ Discussion Papers bgse10_2006, University of Bonn, Germany.
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
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.:
- 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.
- 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).
- Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
- Roger B. Myerson, 1978. "Optimal Auction Design," Discussion Papers 362, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Hain, Roland & Mitra, Manipushpak, 2004.
"Simple sequencing problems with interdependent costs,"
Games and Economic Behavior,
Elsevier, vol. 48(2), pages 271-291, August.
- Manipushpak Mitra & Roland Hain, 2001. "Simple Sequencing Problems with Interdependent Costs," Bonn Econ Discussion Papers bgse20_2001, University of Bonn, Germany.
- Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
- 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.
- Tayfun Sönmez & M. Utku Ünver, 2001. "House Allocation with Existing Tenants: An Equivalence," Game Theory and Information 0112002, EconWPA, revised 26 Sep 2002.
- Manipushpak Mitra, 2002.
"Achieving the first best in sequencing problems,"
Review of Economic Design,
Springer, vol. 7(1), pages 75-91.
- 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.
- Pettersen Strandenes, Siri & Wolfstetter, Elmar, 2005. "Efficient (re-)scheduling: An auction approach," Economics Letters, Elsevier, vol. 89(2), pages 187-192, November.
- 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.
- 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.
- Manipushpak Mitra, 2001.
"Mechanism design in queueing problems,"
Springer, vol. 17(2), pages 277-305.
- Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society.
- 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).
- Myerson, Roger B. & Satterthwaite, Mark A., 1983.
"Efficient mechanisms for bilateral trading,"
Journal of Economic Theory,
Elsevier, vol. 29(2), pages 265-281, April.
- Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Robert Gibbons, Editor & John Roberts, Editor, 2012. "The Handbook of Organizational Economics," Economics Books, Princeton University Press, edition 1, volume 1, number 9889.
- Segal, Ilya R. & Whinston, Michael D., 2011. "A simple status quo that ensures participation (with application to efficient bargaining)," Theoretical Economics, Econometric Society, vol. 6(1), January.
- Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Department of Economics, University of Leicester.
- Stefano Galavotti & Nozomu Muto & Daisuke Oyama, 2011. "On efficient partnership dissolution under ex post individual rationality," Economic Theory, Springer, vol. 48(1), pages 87-123, September.
- Bumin Yenmez, M., 2012. "Dissolving multi-partnerships efficiently," Journal of Mathematical Economics, Elsevier, vol. 48(2), pages 77-82.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.