This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

When Queuening is Better than Push and Shove

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Alex Gershkov
Paul Schweinzer

Additional information is available for the following registered author(s):

Abstract

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: ftp://web.bgse.uni-bonn.de/pub/RePEc/bon/bonedp/bgse10_2006.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by University of Bonn, Germany in its series Bonn Econ Discussion Papers with number bgse10_2006.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length: 19
Date of creation: May 2006
Date of revision:
Handle: RePEc:bon:bonedp:bgse10_2006

Contact details of provider:
Postal: Bonn Graduate School of Economics, University of Bonn, Adenauerallee 24 - 26, 53113 Bonn, Germany
Fax: +49 228 73 9221
Web page: http://www.bgse.uni-bonn.de/index.php?id=494

For technical questions regarding this item, or to correct its listing, contact: (Daniel Park).

Related research
Keywords: Scheduling Queueing Mechanism design

Other versions of this item:

Find related papers by JEL classification:
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

This paper has been announced in the following NEP Reports:

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.:
  1. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April. [Downloadable!] (restricted)
    Other versions:
  2. Hain, Roland & Mitra, Manipushpak, 2004. "Simple sequencing problems with interdependent costs," Games and Economic Behavior, Elsevier, vol. 48(2), pages 271-291, August. [Downloadable!] (restricted)
    Other versions:
  3. Thomas Kittsteiner & Benny Moldovanu, 2004. "Priority Auctions and Queue Disciplines that Depend on Processing Time," Discussion Papers 5, SFB/TR 15 Governance and the Efficiency of Economic Systems, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich. [Downloadable!]
  4. Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998. [Downloadable!]
  5. 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. [Downloadable!] (restricted)
  6. 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. [Downloadable!] (restricted)
    Other versions:
  7. Pettersen Strandenes, Siri & Wolfstetter, Elmar, 2005. "Efficient (re-)scheduling: An auction approach," Economics Letters, Elsevier, vol. 89(2), pages 187-192, November. [Downloadable!] (restricted)
  8. Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society. [Downloadable!]
  9. Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
    Other versions:
  10. Roger B. Myerson, 1978. "Optimal Auction Design," Discussion Papers 362, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  11. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? Want to help out with this project? Look for volunteer opportunities.

This page was last updated on 2008-7-13.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.