Incomplete Information and Multiple Machine Queueing Problems

Manipushpak Mitra

No 19/2001, Bonn Econ Discussion Papers from University of Bonn, Bonn Graduate School of Economics (BGSE)

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.

Keywords: Queueing Problems; First Best Implementability (search for similar items in EconPapers)
JEL-codes: C44 C72 C78 D82 (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/78417/1/bgse19_2001.pdf (application/pdf)

Related works:
Journal Article: Incomplete information and multiple machine queueing problems (2005)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:bonedp:192001

Access Statistics for this paper

More papers in Bonn Econ Discussion Papers from University of Bonn, Bonn Graduate School of Economics (BGSE) Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().