Abstract
We consider infinite two-player games played on finite graphs where the winning condition (say for the first player) is given by a regular omega-language. We address issues of optimization in the construction of winning strategies in such games. Two criteria for optimization are discussed: memory size of finite automata that execute winning strategies, and - for games with liveness requests as winning conditions "waiting times" for the satisfaction of requests. (For the first aspect we report on work of Holtmann and Löding, for the second on work of Horn, Wallmeier, and the author.) © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Thomas, W. (2008). Optimizing winning strategies in regular infinite games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4910 LNCS, pp. 118–123). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
