Finite-state Strategies in Delay Games
Computer Science and Game Theory
2017-09-13 v1 Formal Languages and Automata Theory
Logic in Computer Science
Abstract
What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for all winning conditions that are recognized by automata with acceptance conditions that satisfy a certain aggregation property. Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. In particular, we cover all previous results of that kind as special cases of our uniform approach.
Keywords
Cite
@article{arxiv.1709.03539,
title = {Finite-state Strategies in Delay Games},
author = {Martin Zimmermann},
journal= {arXiv preprint arXiv:1709.03539},
year = {2017}
}
Comments
In Proceedings GandALF 2017, arXiv:1709.01761. Full version at arXiv:1704.08887