.png){kind=icon}
Return
Incomplete information and multiple machine queueing problems - Stochastics and statistics
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2003.10.050.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2004 Elsevier B.V. All rights reserved.
Keywords:
queueing problems
first best implementability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveShareSaveMicro Level Dimensionality Measurement for Product Inspection using Machine Vision.png)
2023 Fifth International Conference on Electrical, Computer and Communication Technologies (ICECCT)
2023 Fifth International Conference on Electrical, Computer and Communication Technologies (ICECCT)IF0
PREAI
ShareSaveShareSaveShareSave
View more