Incomplete Information and Multiple Machine Queueing Problems
In mechanism design problems under incomplete information, it is generally difficult to find decision problems that are first best implementable. A decision problem under incomplete information is first best implementable if there exists a mechanism that extracts the private information and achieves efficiency with a transfer scheme that adds up to zero in every state. One such problem is the queueing problem with one machine. In this paper we identify the conditions on cost structure for which queueing problems with multiple machines are first best implementable.
|Date of creation:||Mar 2001|
|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.:
- 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.
- Theodore Groves & John Ledyard, 1977.
"Some limitations of demand revelaing processes,"
Springer, vol. 29(2), pages 107-124, March.
- Liqun Liu & Guoqiang Tian, 1999. "A characterization of the existenceof optimal dominant strategy mechanisms," Review of Economic Design, Springer, vol. 4(3), pages 205-218.
- 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.
- Theodore Groves & Martin Loeb, 1974.
"Incentives and Public Inputs,"
29, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
- M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1975. "Flowshop Sequencing Problem with Ordered Processing Time Matrices," Management Science, INFORMS, vol. 21(5), pages 544-549, January.
- van den Nouweland, Anne & Krabbenborg, Marc & Potters, Jos, 1992. "Flow-shops with a dominant machine," European Journal of Operational Research, Elsevier, vol. 62(1), pages 38-46, October.
- Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
- Hurwicz, Leonid & Walker, Mark, 1990. "On the Generic Nonoptimality of Dominant-Strategy Allocation Mechanisms: A General Theorem That Includes Pure Exchange Economies," Econometrica, Econometric Society, vol. 58(3), pages 683-704, May.
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-44, September.
- Tian, Guoqiang, 1996. "On the existence of optimal truth-dominant mechanisms," Economics Letters, Elsevier, vol. 53(1), pages 17-24, October.
- Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December.
When requesting a correction, please mention this item's handle: RePEc:bon:bonedp:bgse19_2001. 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 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.