arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.03220physics.soc-phmath.PR
收藏

满足条件的秘书问题:当封闭解满足模拟退火时

The satisficing secretary problem: when closed-form solutions meet simulated annealing

Roberto Brera, Feng Fu

摘要:

秘书问题一直是广泛研究的焦点,其各种扩展为最优停止理论提供了有用的见解。最初的解决方案是设置一个停止阈值,该阈值从大小为$n$的候选池中产生立即被拒绝的样本$r$,并接受随后被面试并优于先前被拒绝的$r$的第一个候选。在现实中,在求职者之间画一条线来区分那些在线以上的人和那些在线以下的人并不罕见。在这里,我们考虑这样的满意sectary问题,认为次优的选择(找到任何顶级$d$候选人)也作为招聘成功。我们使用多个停止标准$(r_1, r_2, \cdots, r_d)$,顺序降低的期望时,事先的选择标准产生没有选择。我们计算的概率,确保顶部$d$候选人在封闭形式的解决方案,这是非常符合计算机模拟。穷举搜索最佳停止必须处理大的参数空间,因此可以很快地产生天文数字大的计算时间。鉴于此,我们采用模拟退火的有效计算方法,找到最佳的$r_i$值,表现相当不错,尽管具有显着更少的计算时间相比,穷举搜索。我们的工作揭示了使用自适应搜索策略结合计算方法最大限度地提高获得满意(次优)结果的可能性。

英文摘要:

The secretary problem has been a focus of extensive study with a variety of extensions that offer useful insights into the theory of optimal stopping. The original solution is to set one stopping threshold that gives rise to an immediately rejected sample $r$ out of the candidate pool of size $n$ and to accept the first candidate that is subsequently interviewed and bests the prior $r$ rejected. In reality, it is not uncommon to draw a line between job candidates to distinguish those above the line vs those below the line. Here we consider such satisficing sectary problem that views suboptimal choices (finding any of the top $d$ candidates) also as hiring success. We use a multiple stopping criteria $(r_1, r_2, \cdots, r_d)$ that sequentially lowers the expectation when the prior selection criteria yields no choice. We calculate the probability of securing the top $d$ candidate in closed form solutions which are in excellent agreement with computer simulations. The exhaustive search for optimal stopping has to deal with large parameter space and thus can quickly incur astronomically large computational times. In light of this, we apply the effective computational method of simulated annealing to find optimal $r_i$ values which performs reasonably well as compared with the exhaustive search despite having significantly less computing time. Our work sheds light on maximizing the likelihood of securing satisficing (suboptimal) outcomes using adaptive search strategy in combination with computation methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑