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! ]

Incomplete Information and Multiple Machine Queueing Problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Manipushpak Mitra

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

Abstract

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.

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/bgse19_2001.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 bgse19_2001.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length: 26
Date of creation: Mar 2001
Date of revision:
Handle: RePEc:bon:bonedp:bgse19_2001

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: Queueing Problems First Best Implementability

Find related papers by JEL classification:
C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Statistical Decision Theory; Operations Research
C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
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. Groves, Theodore & Loeb, Martin, 1975. "Incentives and public inputs," Journal of Public Economics, Elsevier, vol. 4(3), pages 211-226, August. [Downloadable!] (restricted)
    Other versions:
  2. 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. [Downloadable!] (restricted)
  3. Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society. [Downloadable!]
  4. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July. [Downloadable!] (restricted)
  5. Tian, Guoqiang, 1996. "On the existence of optimal truth-dominant mechanisms," Economics Letters, Elsevier, vol. 53(1), pages 17-24, October. [Downloadable!] (restricted)
  6. Theodore Groves & John O. Ledyard, 1976. "Some Limitations of Demand Revealing Processes," Discussion Papers 219, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  7. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June. [Downloadable!] (restricted)
  8. 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. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, 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. Manipushpak Mitra & Suresh Mutuswami, 2006. "Group Strategyproofness in Queueing Models," Economics Discussion Papers 610, University of Essex, Department of Economics. [Downloadable!]
  2. Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics and Osaka School of International Public Policy (OSIPP). [Downloadable!]
Statistics
Access and download statistics

Did you know? There are NEP reports in over 80 fields that deliver new research to your email.

This page was last updated on 2008-10-8.

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.