Author:
Colcombet Thomas,Niwiński Damian
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Positional strategies for mean payoff games;Ehrenfeucht;Internat. J. Game Theory,1979
2. E.A. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy, in: Proc. 32th Ann. IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1991, pp. 368–377.
3. E. Grädel, I. Walukiewicz, Positional determinacy of games with infinitely many priorities, 2004, manuscript.
4. Borel determinacy;Martin;Ann. Math.,1975
5. Infinite games played on finite graphs;McNaughton;Ann. Pure Appl. Logic,1993
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Half-Positional Objectives Recognized by Deterministic B\"uchi Automata;Logical Methods in Computer Science;2024-08-29
2. Positional ω-regular languages;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Continuous Positional Payoffs;Logical Methods in Computer Science;2023-08-03
4. Characterizing Positionality in Games of Infinite Duration over Infinite Graphs;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
5. Roulette games and depths of words over finite commutative rings;Designs, Codes and Cryptography;2021-01-19