Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games
暂无分享,去创建一个
[1] Thomas A. Henzinger,et al. Solving Games Without Determinization , 2006, CSL.
[2] Marcin Jurdzinski,et al. Succinct progress measures for solving parity games , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[3] Marcin Jurdzinski,et al. Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games , 2018, SODA.
[4] Yuri Gurevich,et al. Trees, automata, and games , 1982, STOC '82.
[5] Cristian S. Calude,et al. Deciding parity games in quasipolynomial time , 2017, STOC.
[6] Karoliina Lehtinen,et al. A modal μ perspective on solving parity games in quasi-polynomial time , 2018, LICS.
[7] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[8] Lawrence H. Landweber,et al. Definability in the monadic second-order theory of successor , 1969, Journal of Symbolic Logic.
[9] Thomas Colcombet,et al. Parity games and universal graphs , 2018, ArXiv.
[10] Nathanaël Fijalkow. An Optimal Value Iteration Algorithm for Parity Games , 2018, ArXiv.
[11] E. Emerson,et al. Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.
[12] A. Karzanov,et al. Cyclic games and an algorithm to find minimax cycle means in directed graphs , 1990 .
[13] Udi Boker,et al. Register Games , 2020, Log. Methods Comput. Sci..
[14] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[15] Michal Skrzypczak,et al. How Deterministic are Good-For-Games Automata? , 2017, FSTTCS.
[16] Pierre Ohlmann,et al. The complexity of mean payoff games using universal graphs , 2018, ArXiv.
[17] A. Ehrenfeucht,et al. Positional strategies for mean payoff games , 1979 .