Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
2. The complexity of stochastic games
3. E. Emerson and C. Jutla. Tree automata,μ-calculus and determinacy. InProc. 32nd Symp. on Foundations of Computer Science, pages 368-377, San Juan, 1991. IEEE.
4. E. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments ofu-calculus. InProc. 5th Conf. on CAV, CAV'93, volume 697 of LNCS, pages 385-396. Springer, 1993.
5. Positional strategies for mean payoff games
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. A Parity Game Tale of Two Counters;Electronic Proceedings in Theoretical Computer Science;2019-09-18
3. Recursive stochastic games with positive rewards;Theoretical Computer Science;2019-07
4. An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space;International Journal on Software Tools for Technology Transfer;2019-02-25
5. An ordered approach to solving parity games in quasi polynomial time and quasi linear space;Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software;2017-07-13