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

子博弈最优与先验无关的在线算法

Subgame Optimal and Prior-Independent Online Algorithms

Jason Hartline, Aleck Johnsen, Anant Shah

AI总结:

本文提出博弈论视角下的在线算法设计,定义子博弈最优性并引入先验无关分析,以有限时域滑雪租赁问题为例,给出多项式时间近似方案并实证比较三类算法。

摘要:

本文采用博弈论方法进行在线算法的设计与分析,并以有限时域滑雪租赁问题为例加以说明。该方法允许对在线算法进行超越最坏情况的分析。首先,我们定义了“子博弈最优性”,它比最坏情况最优性更强,因为它要求算法能够利用不采取最坏情况输入的对手。仅关注最坏情况的算法可能远非子博弈最优。其次,我们考虑在线算法的先验无关设计与分析,其中对手不是选择最坏情况输入,而是选择输入上的最坏情况独立同分布。先验无关的在线算法通常在分析上难以处理;相反,我们给出了一个完全多项式时间近似方案来计算它们。为了突出这些范式在有限时域滑雪租赁问题上的潜在改进,我们在先验无关框架下对最坏情况、子博弈最优和先验无关算法进行了实证比较。

英文摘要:

This paper takes a game theoretic approach to the design and analysis of online algorithms and illustrates the approach on the finite-horizon ski-rental problem. This approach allows beyond worst-case analysis of online algorithms. First, we define "subgame optimality" which is stronger than worst case optimality in that it requires the algorithm to take advantage of an adversary not playing a worst case input. Algorithms only focusing on the worst case can be far from subgame optimal. Second, we consider prior-independent design and analysis of online algorithms, where rather than choosing a worst case input, the adversary chooses a worst case independent and identical distribution over inputs. Prior-independent online algorithms are generally analytically intractable; instead we give a fully polynomial time approximation scheme to compute them. Highlighting the potential improvement from these paradigms for the finite-horizon ski-rental problem, we empirically compare worst-case, subgame optimal, and prior-independent algorithms in the prior-independent framework.

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

↑