ON MULTIPLE-CHOICE SECRETARY PROBLEMS

• 成果类型: Article
• 署名作者: PREATER, J
• 刊物名称: MATHEMATICS OF OPERATIONS RESEARCH
• ISSN/ISSBN: 0364-765X
• DOI: 10.1287/moor.19.3.597
• 发表日期: 1994
• 页码: 597-602
• 关键词: optimal selection; assignment

摘要

Two secretary problems based on relative rank are considered, in which the decision maker has any fixed number of choices. In the first the payoff depends in an arbitrary way on acquisitions of ranks 1 and 2; in the second the aim is to maximise the probability of obtaining the best 3 objects. In each case the existence of an optimal selection policy of time threshold type is established.