| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950709 | Information and Computation | 2017 | 22 Pages |
Abstract
We formalise the connection between FCGs and certain infinite-duration games and prove that strategies transfer between them. Using the machinery of FCGs, we provide a recipe that can be used to very easily deduce that many infinite-duration games, e.g., mean-payoff, parity, and energy games, are memoryless determined.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Benjamin Aminof, Sasha Rubin,