序列选择问题的统一解法
A Unified Approach for Solving Sequential Selection Problems
摘要:
在本文中,我们开发了一个统一的方法来解决广泛的一类顺序选择问题。这个类包括,但不限于,无信息的选择问题,排名依赖的奖励,并考虑固定以及随机问题的视野。建议的框架是基于减少原来的选择问题之一的最佳停止一系列明智地构建独立的随机变量。我们证明,我们的方法可以精确和有效地计算各种顺序选择问题的最优策略和各种性能指标,其中有几个尚未解决的日期。
英文摘要:
In this paper we develop a unified approach for solving a wide class of sequential selection problems. This class includes, but is not limited to, selection problems with no-information, rank-dependent rewards, and considers both fixed as well as random problem horizons. The proposed framework is based on a reduction of the original selection problem to one of optimal stopping for a sequence of judiciously constructed independent random variables. We demonstrate that our approach allows exact and efficient computation of optimal policies and various performance metrics thereof for a variety of sequential selection problems, several of which have not been solved to date.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。