arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.07601cs.DSmath.STstat.TH
收藏

在线计算中的随机输入模型

Stochastic Input Models in Online Computing

Yasushi Kawase

摘要:

本文研究了12个在线问题的随机输入模型,揭示了模型竞争比之间的关系。竞争比被定义为在输入分布受限的情况下,在线算法得到的解的期望最优值与期望利润之间的最差比值。为了处理广泛的一类在线问题,我们使用了一个框架,称为问答游戏,介绍了本大卫等人。随机输入模型包括两种类型:已知分布和未知分布。对于每种类型,我们考虑六类分布:依赖分布,确定性输入,独立分布,相同的独立分布,确定性输入的随机顺序,以及独立分布的随机顺序。作为模型的应用,我们考虑了两个基本的在线问题,这是秘书问题和先知不等式问题的变种,在十二个随机输入模型。通过这些问题,我们看到了竞争比的差异。

英文摘要:

In this paper, we study twelve stochastic input models for online problems and reveal the relationships among the competitive ratios for the models. The competitive ratio is defined as the worst ratio between the expected optimal value and the expected profit of the solution obtained by the online algorithm where the input distribution is restricted according to the model. To handle a broad class of online problems, we use a framework called request-answer games that is introduced by Ben-David et al. The stochastic input models consist of two types: known distribution and unknown distribution. For each type, we consider six classes of distributions: dependent distributions, deterministic input, independent distributions, identical independent distribution, random order of a deterministic input, and random order of independent distributions. As an application of the models, we consider two basic online problems, which are variants of the secretary problem and the prophet inequality problem, under the twelve stochastic input models. We see the difference of the competitive ratios through these problems.

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

↑