How Much Lookahead is Needed to Win Infinite Games?
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. For $\omega$-regular winning conditions it is known that such games can be solved in doubly-exponential time and that doubly-exponential lookahead is sufficien...
Na minha lista:
| Principais autores: | , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Logical Methods in Computer Science e.V.
2017-04-01
|
| 叢編: | Logical Methods in Computer Science |
| 主題: | |
| 在線閱讀: | https://lmcs.episciences.org/2011/pdf |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|