Approximating the Minimal Lookahead Needed to Win Infinite Games

TL;DR

This paper introduces an exponential-time algorithm to approximate the smallest lookahead required for winning infinite delay games with omega-regular winning conditions.

Contribution

It provides the first approximation algorithm for minimal lookahead in infinite delay games, advancing understanding of delay game complexity.

Findings

Algorithm effectively approximates minimal lookahead

Exponential-time complexity established

Advances theoretical understanding of delay games

Abstract

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