广义秘书问题的渐近分析
An Asymptotic Analysis on Generalized Secretary Problem
摘要:
作为一个著名的结果,秘书问题的"37%定律“广泛影响了人们对在线决策策略的看法。然而,使用这种策略,太多有吸引力的候选人可能会在前37\%被拒绝,并且在实践中人们也倾向于更早地停止\cite{Bearden_early}。在本文中,我们认为,在大多数情况下,只有最好的优化不会获得最优的结果,而最佳的截止应该是$O(\sqrt{n})$。并且证明了在某些只关心几个最佳候选的严格目标中,仍然需要$Θ(n)$跳过。
英文摘要:
As a famous result, the ``37\% Law'' for Secretary Problem has widely influenced peoples' perception on online decision strategies about choice. However, using this strategy, too many attractive candidates may be rejected in the first 37\%, and in practice people also tend to stop earlier\cite{Bearden_early}. In this paper, we argued that in most cases, the best-only optimization does not obtain an optimal outcome, while the optimal cutoff should be $O(\sqrt{n})$. And we also showed that in some strict objective that only cares several best candidates, $Θ(n)$ skips are still needed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。