Incomplete information and multiple machine queueing problems

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 can find queueing problem with one machine that are first best implementable under certain cost conditions. In this paper we identify the conditions on cost structure for which queueing problems with multiple machines are first best implementable.