Approximating the Minimal Lookahead Needed to Win Infinite Games
Formal Languages and Automata Theory
2022-03-02 v2 Computer Science and Game Theory
Abstract
We present an exponential-time algorithm approximating the minimal lookahead necessary to win an -regular delay game.
Keywords
Cite
@article{arxiv.2010.11706,
title = {Approximating the Minimal Lookahead Needed to Win Infinite Games},
author = {Martin Zimmermann},
journal= {arXiv preprint arXiv:2010.11706},
year = {2022}
}