Approximating the Minimal Lookahead Needed to Win Infinite Games

Abstract

We present an exponential-time algorithm approximating the minimal lookahead necessary to win an $\omega$-regular delay game.