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

对二人回合制游戏和非二元AUSO的随机动作移除算法的改进亚指数分析

Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs

Blavatnik School of Computer Science, Tel Aviv University(特拉维夫大学布拉瓦特尼克计算机学院)

Uri Zwick

AI总结:

研究二人回合制等游戏及非二元AUSO的随机动作移除算法,它是随机策略迭代算法,改进自Matoušek等人算法。改进分析表明其能在\(e^{O(\sqrt{n\ln(m/n)})}\)时间内解决有\(n\)个状态和\(m\geq2n\)个动作的游戏,是解决此类游戏最快随机算法。

摘要:

我们给出了用于解决二人、零和、回合制、可能具有无限时长、在图或有限状态集上进行的随机或非随机游戏的随机动作移除算法的简洁描述和改进分析。该算法更广泛地可用于找到非二元超立方体的无环唯一汇定向(AUSO)的汇。可通过该算法解决的游戏类别包括折扣和非折扣随机游戏(SGs)以及平均收益游戏(MPGs)。所得到的算法是解决此类游戏已知最快的随机算法,比Hansen和Zwick(STOC 2015)的复杂得多的算法略有改进。随机动作移除算法是用于解决线性规划(LP)问题或更一般的LP型问题的随机面算法的改编。随机面算法的两个对偶变体由Kalai(STOC 1992)和Matoušek、Sharir及Welzl(SoCG 1992)独立开发。对于LP问题,Kalai的算法是原始单纯形算法,而Matoušek、Sharir和Welzl的算法是对偶单纯形算法。用于游戏或AUSO的随机动作移除算法是Matoušek、Sharir和Welzl对偶算法的改编,是一种随机策略迭代算法。我们的改进分析表明,随机动作移除算法在\(e^{O(\sqrt{n\ln(m/n)})}\)时间内解决具有\(n\)个状态和\(m\geq2n\)个动作的游戏。这改进了Matoušek、Sharir和Welzl(SoCG 1992)对该算法分析得出的先前\(e^{O(\sqrt{n\ln(m/\sqrt n)})}\)界限。先前使用Hansen和Zwick(STOC 2015)解决LP和LP型问题的复杂得多的算法获得了具有更差常数因子的\(e^{O(\sqrt{n\ln(m/n)})}\)界限。

英文摘要:

We give a concise description and an improved analysis of the Random-Action-Removal algorithm for solving 2-player, 0-sum, turn-based, possibly infinite duration, stochastic or non-stochastic games played on graphs, or on finite sets of states. More generally, the algorithm can be used to find the sink of an Acyclic Unique Sink Orientation (AUSO) of a non-binary hypercube. The families of games that can be solved by the algorithm include discounted and non-discounted stochastic games (SGs) and Mean Payoff Games (MPGs). The obtained algorithm is the fastest known randomized algorithm for solving such games, slightly improving on a much more complicated algorithm of Hansen and Zwick (STOC 2015). The Random-Action-Removal algorithm is an adaptation of the Random-Facet algorithm used to solve linear programming (LP) problems, or, more generally, LP-type problems. Two dual variants of the Random-Facet algorithm were developed independently by Kalai (STOC 1992) and by Matou{š}ek, Sharir and Welzl (SoCG 1992). For LP problems, the algorithm of Kalai is a primal \emph{simplex} algorithm, while the algorithm of Matou{š}ek, Sharir and Welzl is a dual \emph{simplex} algorithm. The Random-Action-Removal algorithm for games or AUSOs is an adaptation of the dual algorithm of Matou{š}ek, Sharir and Welzl, and is a randomized \emph{strategy iteration} algorithm. Our improved analysis shows that the Random-Action-Removal algorithm solves games with~$n$ states and $m\ge 2n$ actions in $e^{O(\sqrt{n\ln(m/n)})}$ time. This improves on a previous $e^{O(\sqrt{n\ln(m/\sqrt n)})}$ bound for the algorithm that follows from the analysis of Matou{š}ek, Sharir and Welzl (SoCG 1992). An $e^{O(\sqrt{n\ln(m/n)})}$ bound, with worse constant factors, was previously obtained using a much more complicated algorithm for solving LP and LP-type problems of Hansen and Zwick (STOC 2015).

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

↑