.png){kind=icon}
返回
DYNAMIC-PROGRAMMING FORMULATION OF THE GROUP INTERVIEW PROBLEM WITH A GENERAL UTILITY FUNCTION
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)90123-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many managerial decision situations such as buying an electronic appliance, several groups of alternatives are presented sequentially and an accept-or-reject decision is made immediately after evaluating the alternatives in each group. If each group contains only one alternative, this optimal selection problem is known as the secretary problem which has a long and rich history of research devoted to developing solution strategies. We propose a more generalized version of the secretary problem, called the group interview problem, in which each group contains more than one alternative and each group is presented and evaluated sequentially over time. Using a dynamic programming approach, we derive a backward recursive equation for solving the group interview problem in which a decision maker's utility of selecting a certain choice is expressed as a general function. Depending on the specific form of this function, we derive optimal selection strategies for various types of group interview problems such as minimum rank, maximum utility, best choice, and one out of the p best choice problems.
Keyword:
APPLIED PROBABILITY
OPTIMAL STOPPING RULE
DECISION ANALYSIS
SEQUENTIAL DECISION MAKING
DYNAMIC PROGRAMMING
STOCHASTIC MODEL APPLICATIONS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容