Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/78417 
Autor:innen: 
Erscheinungsjahr: 
2001
Schriftenreihe/Nr.: 
Bonn Econ Discussion Papers No. 19/2001
Verlag: 
University of Bonn, Bonn Graduate School of Economics (BGSE), Bonn
Zusammenfassung: 
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.
Schlagwörter: 
Queueing Problems
First Best Implementability
JEL: 
C44
C72
C78
D82
Dokumentart: 
Working Paper

Datei(en):
Datei
Größe
352.34 kB





Publikationen in EconStor sind urheberrechtlich geschützt.