.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
queueing problems
first best implementability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Micro 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
分享收藏分享收藏
查看更多内容