论文标题
近似赢得无限游戏所需的最小lookahead
Approximating the Minimal Lookahead Needed to Win Infinite Games
论文作者
论文摘要
我们提出了一种指数时间算法，该算法近似于赢得$ω$的延迟游戏所需的最小lookahead。
We present an exponential-time algorithm approximating the minimal lookahead necessary to win an $ω$-regular delay game.
