Advanced Search
MyIDEAS: Login to save this paper or follow this series

Priority Auctions and Queue Disciplines that Depend on Processing Time

Contents:

Author Info

  • Kittsteiner, Thomas
  • Moldovanu, Benny

Abstract

Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that differ in the definition of bids (these may reflect either total payments or payments per unit of time) and in the timing of payments (before, or after service). In both schemes, a customer obtains priority over all customers (waiting in the queue or arriving while he is waiting) who make lower bids. Our main results show how the convexity/concavity of the function expressing the costs of delay determines the queue-discipline (i.e., SPT, LPT) arising in a bidding equilibrium.

Download Info

If 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.
File URL: http://epub.ub.uni-muenchen.de/13541/1/5.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich in its series Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems with number 5.

as in new window
Length:
Date of creation: May 2004
Date of revision:
Handle: RePEc:trf:wpaper:5

Contact details of provider:
Postal: Geschwister-Scholl-Platz 1, D-80539 Munich, Germany
Phone: +49-(0)89-2180-3405
Fax: +49-(0)89-2180-3510
Web page: http://www.sfbtr15.de/
More information through EDIRC

Related research

Keywords:

Other versions of this item:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Philippe Jehiel & Benny Moldovanu, 1998. "Efficient Design with Interdependent Valuations," Discussion Papers 1244, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  2. K. R. Balachandran, 1972. "Purchasing Priorities in Queues," Management Science, INFORMS, vol. 18(5-Part-1), pages 319-326, January.
  3. Tilt, Borge & Balachandran, K. R., 1979. "Stable and superstable customer policies in queues with balking and priority options," European Journal of Operational Research, Elsevier, vol. 3(6), pages 485-498, November.
  4. Manipushpak Mitra & Roland Hain, 2001. "Simple Sequencing Problems with Interdependent Costs," Bonn Econ Discussion Papers bgse20_2001, University of Bonn, Germany.
  5. repec:wop:humbsf:2000-72 is not listed on IDEAS
  6. McAfee, R. Preston, 1991. "Efficient allocation with continuous quantities," Journal of Economic Theory, Elsevier, vol. 53(1), pages 51-74, February.
  7. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
  8. P. Dasgupta & Eric Maskin, 1998. "Efficient Auctions," Harvard Institute of Economic Research Working Papers 1857, Harvard - Institute of Economic Research.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Moulin, Hervé, 2008. "Proportional scheduling, split-proofness, and merge-proofness," Games and Economic Behavior, Elsevier, vol. 63(2), pages 567-587, July.
  2. Philippe Jehiel & Benny Moldovanu, 2006. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Levine's Bibliography 122247000000001129, UCLA Department of Economics.
  3. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
  4. Hoppe, Heidrun C. & Moldovanu, Benny & Sela, Aner, 2005. "The Theory of Assortative Matching Based on Costly Signals," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 85, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
  5. Benny Moldovanu & Alex Gershkov, 2008. "The Trade-off Between Fast Learning and Dynamic Efficiency," 2008 Meeting Papers 348, Society for Economic Dynamics.
  6. Moldovanu, Benny & Dizdar, Deniz & Gershkov, Alex, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
  7. Gershkov, Alex & Moldovanu, Benny, 2012. "Optimal search, learning and implementation," Journal of Economic Theory, Elsevier, vol. 147(3), pages 881-909.
  8. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Cowles Foundation Discussion Papers 1757, Cowles Foundation for Research in Economics, Yale University.
  9. Alex Gershkov & Paul Schweinzer, 2006. "When Queuening is Better than Push and Shove," Bonn Econ Discussion Papers bgse10_2006, University of Bonn, Germany.
  10. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
  11. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:trf:wpaper:5. 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: (Alexandra Frank).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.