Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of mean payoff games on graphs
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Games where you can play optimally without any memory
CONCUR 2005 - Concurrency Theory
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal Strategy Synthesis in Request-Response Games
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
On Omega-Languages Defined by Mean-Payoff Conditions
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Pure stationary optimal strategies in Markov decision processes
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Perfect information stochastic priority games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Inspired by the paper of de Alfaro, Henzinger and Majumdar [1] about discounted μ-calculus we show new surprising links between parity games and different classes of discounted games