Priority Auctions and Queue Disciplines That Depend on Processing Time
We 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., shortest-processing-time-first (SPT), longest-processing-time-first (LPT)) arising in a bidding equilibrium.
Volume (Year): 51 (2005)
Issue (Month): 2 (February)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
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.:
- Jehiel, Phillipe & Moldovanu, Benny, 1998.
"Efficient Design with Interdependent Valuations,"
Sonderforschungsbereich 504 Publications
98-22, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Philippe Jehiel & Benny Moldovanu, 1998. "Efficient Design with Interdependent Valuations," Discussion Papers 1244, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Jehiel, Phillipe & Moldovanu, Benny, 1999. "Efficient Design with Interdependent Valuations," Sonderforschungsbereich 504 Publications 99-74, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- K. R. Balachandran, 1972. "Purchasing Priorities in Queues," Management Science, INFORMS, vol. 18(5-Part-1), pages 319-326, January.
- 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.
- Partha Dasgupta & Eric Maskin, 2000.
The Quarterly Journal of Economics,
MIT Press, vol. 115(2), pages 341-388, May.
- P. Dasgupta & Eric Maskin, 1998. "Efficient Auctions," Harvard Institute of Economic Research Working Papers 1857, Harvard - Institute of Economic Research.
- Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
- McAfee, R. Preston, 1991. "Efficient allocation with continuous quantities," Journal of Economic Theory, Elsevier, vol. 53(1), pages 51-74, February.
- 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.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:51:y:2005:i:2:p:236-248. 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: (Mirko Janc)
If references are entirely missing, you can add them using this form.