多重回归的秘书问题
The multi-returning secretary problem
摘要:
在本文中,我们考虑所谓的多返回秘书问题,秘书问题的一个版本,其中每个候选人有$m$相同的副本。病例$m=2$已经由几位作者使用不同的方法完全解决,病例$m>2$尚未得到满意解决。在这里,我们提供了一个有效的算法来计算最佳阈值和成功的概率为每个$m$。此外,我们给出了一种方法来确定其渐近值的基础上的解决方案的$m$常微分方程组。
英文摘要:
In this paper we consider the so-called Multi-returning secretary problem, a version of the Secretary problem in which each candidate has $m$ identical copies. The case $m=2$ has already been completely solved by several authors using different methods both the case $m>2$ had not been satisfactorily solved yet. Here, we provide and efficient algorithm to compute the optimal threshold and the probability of success for every $m$. Moreover, we give a method to determine their asymtoptic values based on the solution of a system of $m$ ODEs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。