Approximating the Minimal Lookahead Needed to Win Infinite Games
arXiv:2010.11706
Abstract
We present an exponential-time algorithm approximating the minimal lookahead necessary to win an -regular delay game.
arXiv:2010.11706
We present an exponential-time algorithm approximating the minimal lookahead necessary to win an -regular delay game.