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

来自样本的先知不等式:样本越多越好吗?

Prophet Inequality from Samples: Is the More the Merrier?

Tomer Ezra

AI总结:

本文研究基于样本的单选择先知不等式问题,证明样本增多反而使1/2最优竞争比不可达,并设计序数静态阈值算法达到0.433竞争比。

摘要:

我们研究单选择先知不等式问题的一个变体,其中决策者不知道底层分布,只能获得来自这些分布的一组样本。Rubinstein等人[2020]表明,令人惊讶的是,通过观察一组n个样本(每个分布各一个),可以获得最优竞争比1/2。在本文中,我们证明当决策者获得更多样本时,这一1/2的竞争比变得不可达到。然后我们考察序数静态阈值算法的自然类,其中算法选择第i个排名最高的样本,将该样本设为静态阈值,然后选择第一个超过该阈值的值。我们证明该类中最佳可能的算法达到0.433的竞争比。在此过程中,我们利用本文中开发的工具,为Rubinstein等人[2020]的主要结果提供了一个替代证明。

英文摘要:

We study a variant of the single-choice prophet inequality problem where the decision-maker does not know the underlying distribution and has only access to a set of samples from the distributions. Rubinstein et al. [2020] showed that the optimal competitive-ratio of $\frac{1}{2}$ can surprisingly be obtained by observing a set of $n$ samples, one from each of the distributions. In this paper, we prove that this competitive-ratio of $\frac{1}{2}$ becomes unattainable when the decision-maker is provided with a set of more samples. We then examine the natural class of ordinal static threshold algorithms, where the algorithm selects the $i$-th highest ranked sample, sets this sample as a static threshold, and then chooses the first value that exceeds this threshold. We show that the best possible algorithm within this class achieves a competitive-ratio of $0.433$. Along the way, we utilize the tools developed in the paper and provide an alternative proof of the main result of Rubinstein et al. [2020].

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

↑