arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.09215cs.GT
收藏

“谁是下一个排队的人?”"论贝叶斯在线环境中知道到达顺序的意义

"Who Is Next in Line?'' On the Significance of Knowing the Arrival Order in Bayesian Online Settings

Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang

摘要:

我们引入了一个新的措施,在贝叶斯设置,输入是从一个已知的先验知识,但实现揭示一个接一个的在线时尚的在线算法的性能。我们的新措施被称为订单竞争比。它被定义为最差情况下(在所有的分布序列)之间的最佳顺序感知算法和顺序感知算法的性能比,并量化的损失,是由于缺乏知识的到达顺序。尽管越来越多的兴趣的作用,到达顺序的在线算法的性能,这种损失一直被忽视到目前为止。我们研究了范式先知不等式问题中的序竞争比,对于两个常见的目标函数:(i)最大化期望值,(ii)最大化获得最大值的概率;以及关于两个算法族,即(i)自适应算法,(ii)单阈值算法。我们提供严格的界限,所有四个组合,相对于确定性算法。我们的分析需要新的想法,并从标准技术出发。特别是,我们的自适应算法不可避免地超越单阈值算法。相对于顺序竞争比测量的结果捕捉的直觉,自适应算法比单阈值的,并可能导致一个更好的算法建议比经典的竞争比测量。

英文摘要:

We introduce a new measure for the performance of online algorithms in Bayesian settings, where the input is drawn from a known prior, but the realizations are revealed one-by-one in an online fashion. Our new measure is called order-competitive ratio. It is defined as the worst case (over all distribution sequences) ratio between the performance of the best order-unaware and order-aware algorithms, and quantifies the loss that is incurred due to lack of knowledge of the arrival order. Despite the growing interest in the role of the arrival order on the performance of online algorithms, this loss has been overlooked thus far. We study the order-competitive ratio in the paradigmatic prophet inequality problem, for the two common objective functions of (i) maximizing the expected value, and (ii) maximizing the probability of obtaining the largest value; and with respect to two families of algorithms, namely (i) adaptive algorithms, and (ii) single-threshold algorithms. We provide tight bounds for all four combinations, with respect to deterministic algorithms. Our analysis requires new ideas and departs from standard techniques. In particular, our adaptive algorithms inevitably go beyond single-threshold algorithms. The results with respect to the order-competitive ratio measure capture the intuition that adaptive algorithms are stronger than single-threshold ones, and may lead to a better algorithmic advice than the classical competitive ratio measure.

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

↑