论文标题
多回报的秘书问题
The multi-returning secretary problem
论文作者
论文摘要
在本文中，我们考虑了所谓的多回报秘书问题，这是秘书问题的一个版本，其中每个候选人都有$ m $相同的副本。 $ m = 2 $的情况已经被几位作者完全解决了使用不同的方法$ m> 2 $尚未令人满意地解决。在这里，我们提供有效的算法来计算每$ m $的最佳阈值和成功的可能性。此外，我们提供了一种基于$ m $ odes系统的解决方案来确定其不可能值的方法。
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.
