Template-Type: ReDIF-Paper 1.0
Title: Incomplete Information and Multiple Machine Queueing Problems 
Author-Name: Manipushpak Mitra 
Classification-JEL: C44, C72, C78, D82
Keywords: Queueing Problems, First Best Implementability
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.

Note: 
Length: 26
Creation-Date: 2001-03
Revision-Date: 
File-URL: http://www.wiwi.uni-bonn.de/bgsepapers/bonedp/bgse19_2001.pdf
File-Format: application/pdf
Handle: RePEc:bon:bonedp:bgse19_2001