arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.00502econ.TH
收藏

鲁棒顺序搜索

Robust Sequential Search

Karl H. Schlag, Andriy Zapechelnyuk

摘要:

我们研究无先验的顺序搜索。我们的兴趣在于在每个先前和之后的历史下接近最优的决策规则。我们称这些规则为动态鲁棒的。检索文献采用基于截断策略的最优规则,这些策略不具有动态鲁棒性。我们推导出动态鲁棒规则,并表明其性能超过1/2的最佳对二进制环境和1/4的最佳对所有环境。这种性能随着外部选项值的增加而显著提高,例如,如果外部选项超过最高可能选项的1/6,则其超过最优值的2/3。

英文摘要:

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules dynamically robust. The search literature employs optimal rules based on cutoff strategies that are not dynamically robust. We derive dynamically robust rules and show that their performance exceeds 1/2 of the optimum against binary environments and 1/4 of the optimum against all environments. This performance improves substantially with the outside option value, for instance, it exceeds 2/3 of the optimum if the outside option exceeds 1/6 of the highest possible alternative.

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

↑