奇偶博弈随机刻面算法的次指数下界
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games
摘要：
在Friedmann、Hansen和Zwick（2011）中，我们声称Kalai、Matousek、Sharir和Welzl的Random-Facet算法执行的旋转步骤的预期数量等于Random-Facet^* 执行的旋转步骤的预期数量，Random-Facet是Random-Facet的一个变体，其随机决策基于一个随机排列。然后我们得到了Random-Facet^* 执行的旋转步骤的预期数量的下限，并声称同样的下限也适用于Random-Facet。不幸的是，Random-Facet和Random-Facet^* 执行的预期步骤数相同的说法是错误的。我们在这里提供了简单的例子，表明这两种算法所执行的步骤的预期数量是不一样的。
英文摘要：
In Friedmann, Hansen, and Zwick (2011) we claimed that the expected number of pivoting steps performed by the Random-Facet algorithm of Kalai and of Matousek, Sharir, and Welzl is equal to the expected number of pivoting steps performed by Random-Facet^*, a variant of Random-Facet that bases its random decisions on one random permutation. We then obtained a lower bound on the expected number of pivoting steps performed by Random-Facet^* and claimed that the same lower bound holds also for Random-Facet. Unfortunately, the claim that the expected numbers of steps performed by Random-Facet and Random-Facet^* are the same is false. We provide here simple examples that show that the expected numbers of steps performed by the two algorithms are not the same.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
