随机优势与在线算法的双射比
Stochastic dominance and the bijective ratio of online algorithms
摘要:
随机优势是一种用于评估在线算法性能的技术,它在比较的算法之间提供了直观但强大的随机顺序。因此,这适用于双射分析,这可以被解释为随机优势,假设在请求上均匀分布。这些技术已被应用到一些在线问题,并提供了一个明确的分离算法的性能差异显着在实践中。然而,在某些情况下,由于它们规定了比较算法之间的严格关系,因此它们不容易适用。在本文中,我们提出了这些缺点的补救措施。首先,我们建立了充分条件,使我们能够证明双射最优的算法的某一类广泛的问题,我们证明了这种方法的背景下,一些深入研究的在线问题。其次,占的情况下,两个算法是不可比拟的,或者没有明确的最佳,我们引入双射比作为一个自然的扩展(精确)双射分析。我们的定义很容易推广到随机优势。这使得双射分析(和随机优势)的概念适用于所有在线问题,并允许纳入其他有用的技术,如摊还分析。我们证明了适用性的双射比的基本在线问题之一,即连续$k$服务器的问题,如线,圆,和星的度量。在其他结果中,我们表明,贪心算法达到双射比的$O(k)$在这些指标一致。这些结果证实了以前的广泛研究,这些研究证明了该算法在实践中对所述指标的效率,然而,这并没有反映在竞争分析中。
英文摘要:
Stochastic dominance is a technique for evaluating the performance of online algorithms that provides an intuitive, yet powerful stochastic order between the compared algorithms. Accordingly this holds for bijective analysis, which can be interpreted as stochastic dominance assuming the uniform distribution over requests. These techniques have been applied to some online problems, and have provided a clear separation between algorithms whose performance varies significantly in practice. However, there are situations in which they are not readily applicable due to the fact that they stipulate a stringent relation between the compared algorithms. In this paper, we propose remedies for these shortcomings. First, we establish sufficient conditions that allow us to prove the bijective optimality of a certain class of algorithms for a wide range of problems; we demonstrate this approach in the context of some well-studied online problems. Second, to account for situations in which two algorithms are incomparable or there is no clear optimum, we introduce the bijective ratio as a natural extension of (exact) bijective analysis. Our definition readily generalizes to stochastic dominance. This renders the concept of bijective analysis (and that of stochastic dominance) applicable to all online problems, and allows for the incorporation of other useful techniques such as amortized analysis. We demonstrate the applicability of the bijective ratio to one of the fundamental online problems, namely the continuous $k$-server problem on metrics such as the line, the circle, and the star. Among other results, we show that the greedy algorithm attains bijective ratios of $O(k)$ consistently across these metrics. These results confirm extensive previous studies that gave evidence of the efficiency of this algorithm on said metrics in practice, which, however, is not reflected in competitive analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。