Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/78417
Authors: 
Mitra, Manipushpak
Year of Publication: 
2001
Series/Report no.: 
Bonn Econ Discussion Papers 19/2001
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.
Subjects: 
Queueing Problems
First Best Implementability
JEL: 
C44
C72
C78
D82
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.