| No. |
Title |
Author |
Year |
| 1 |
How to Play Optimally for Regular Objectives? |
Bouyer, Patricia et al. |
2023 |
| 2 |
Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs |
Bouyer, Patricia et al. |
2022 |
| 3 |
CONCUR Test-Of-Time Award 2022 (Invited Paper) |
Castellani, Ilaria et al. |
2022 |
| 4 |
Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem Under Finite-Memory Assumptions |
Main, James C. A. et al. |
2022 |
| 5 |
Half-Positional Objectives Recognized by Deterministic Büchi Automata |
Bouyer, Patricia et al. |
2022 |
| 6 |
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk) |
Bouyer, Patricia et al. |
2022 |
| 7 |
Arena-Independent Finite-Memory Determinacy in Stochastic Games |
Bouyer, Patricia et al. |
2021 |
| 8 |
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives |
Main, James C. A. et al. |
2021 |
| 9 |
Games Where You Can Play Optimally with Arena-Independent Finite Memory |
Bouyer, Patricia et al. |
2020 |
| 10 |
Energy Mean-Payoff Games |
Bruyère, Véronique et al. |
2019 |
| 11 |
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives |
Brihaye, Thomas et al. |
2019 |
| 12 |
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions |
Le Roux, Stéphane et al. |
2018 |
| 13 |
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes |
Berthon, Raphaël et al. |
2017 |
| 14 |
Reachability in Networks of Register Protocols under Stochastic Schedulers |
Bouyer, Patricia et al. |
2016 |
| 15 |
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games |
Bruyère, Véronique et al. |
2014 |
