| A Bridge between Polynomial Optimization and Games with Imperfect Recall | 0 | 0.34 | 2020 |
| Alternating Nonzero Automata. | 0 | 0.34 | 2018 |
| CONTROLLING A POPULATION | 0 | 0.34 | 2017 |
| Deciding Maxmin Reachability in Half-Blind Stochastic Games. | 0 | 0.34 | 2016 |
| Deciding the value 1 problem for probabilistic leaktight automata | 0 | 0.34 | 2015 |
| Two Recursively Inseparable Problems for Probabilistic Automata. | 1 | 0.36 | 2014 |
| Perfect-Information Stochastic Mean-Payoff Parity Games. | 5 | 0.45 | 2014 |
| Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes. | 0 | 0.34 | 2014 |
| Two-Player Perfect-Information Shift-Invariant Submixing Stochastic Games Are Half-Positional. | 3 | 0.38 | 2014 |
| Asynchronous games over tree architectures | 11 | 0.58 | 2013 |
| On Subgame Perfection in Quantitative Reachability Games | 3 | 0.39 | 2012 |
| Deciding the value 1 problem for probabilistic leaktight automata. | 13 | 0.79 | 2012 |
| Subgame perfection for equilibria in quantitative reachability games | 1 | 0.40 | 2012 |
| Black Well Optimal Strategies In Priority Mean-Payoff Games | 0 | 0.34 | 2012 |
| Pushing undecidability of the isolation problem for probabilistic automata | 0 | 0.34 | 2011 |
| A Class of Probabilistic Automata with a Decidable Value 1 Problem | 0 | 0.34 | 2011 |
| Solving simple stochastic tail games | 14 | 0.97 | 2010 |
| Optimal Zielonka-type construction of deterministic asynchronous automata | 13 | 0.60 | 2010 |
| Randomness for Free | 9 | 0.57 | 2010 |
| Probabilistic automata on finite words: decidable and undecidable problems | 41 | 1.68 | 2010 |
| Solving Simple Stochastic Games with Few Random Vertices | 0 | 0.34 | 2009 |
| Solving Simple Stochastic Games with Few Random Vertices | 6 | 0.57 | 2009 |
| Qualitative Determinacy and Decidability of Stochastic Games with Signals | 23 | 1.05 | 2009 |
| Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games | 0 | 0.34 | 2008 |
| Simple stochastic games with few random vertices are easy to solve | 15 | 0.92 | 2008 |
| Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides | 0 | 0.34 | 2008 |
| Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions | 1 | 0.36 | 2008 |
| Solving Simple Stochastic Games | 3 | 0.52 | 2008 |
| Pure stationary optimal strategies in Markov decision processes | 13 | 1.02 | 2007 |
| Limits of Multi-Discounted Markov Decision Processes | 6 | 0.66 | 2007 |
| Perfect Information Stochastic Priority Games | 15 | 1.04 | 2007 |
| Deterministic priority mean-payoff games as limits of discounted games | 6 | 0.80 | 2006 |
| Discounting Infinite Games But How and Why? | 1 | 0.36 | 2005 |
| Games where you can play optimally without any memory | 27 | 1.67 | 2005 |
| When Can You Play Positionally? | 19 | 1.11 | 2004 |
