一类广义秘书问题的近似结果
Approximate results for a generalized secretary problem
摘要:
经典秘书问题的一个版本进行了研究,其中之一是有兴趣选择一个最好的一组n个不同排名的人谁是一个接一个随机顺序。假设b是一个预先指定的(自然)数。很长时间以来已知的是,对于最优策略,需要计算b位置阈值,例如通过反向归纳。在本文中,我们研究近似的政策,只使用一个或两个位置的阈值,虽然与水平排名。我们给出了精确和渐近(当n趋于无穷大)的结果,这表明双水平政策是一个非常准确的近似。
英文摘要:
A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is a preassigned (natural) number. It is known, already for a long time, that for the optimal policy one needs to compute b position thresholds, for instance via backwards induction. In this paper we study approximate policies, that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n tends to infinity) results, which show that the double-level policy is an extremely accurate approximation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。