Name
Abstract | ||
|---|---|---|
What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question by presenting a very general framework that allows to remove delay: finite-state strategies exist for all winning conditions where the resulting delay-free game admits a finite-state strategy. The framework is applicable to games whose winning condition is recognized by an automaton with an acceptance condition that satisfies a certain aggregation property. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ic.2019.104500 | Information and Computation |
Keywords | DocType | Volume |
Delay games,Finite-state strategies,Transducers,Tradeoffs | Journal | 272 |
ISSN | Citations | PageRank |
0890-5401 | 1 | 0.40 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sarah Winter | 1 | 1 | 0.40 |
| Martin Zimmermann 0002 | 2 | 35 | 10.88 |