Automated synthesis of reliable and efficient systems through game theory: a case study - Mickael Randour (CoRR, 2012)

Strategy synthesis for multi-dimensional quantitative objectives. - Krishnendu Chatterjee; Mickael Randour; Jean-François Raskin (Acta Informatica, 2014)

Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. - Véronique Bruyère; Emmanuel Filiot; Mickael Randour; Jean-François Raskin (SR, 2014)

Variations on the Stochastic Shortest Path Problem. - Mickael Randour; Jean-François Raskin; Ocan Sankur (VMCAI, 2015)

Average-energy games. - Patricia Bouyer; Nicolas Markey; Mickael Randour; Kim Guldstrand Larsen; Simon Laursen (GandALF, 2015)

Average-energy games (full version). - Patricia Bouyer; Nicolas Markey; Mickael Randour; Kim G. Larsen; Simon Laursen (CoRR, 2015)

Looking at mean-payoff and total-payoff through windows. - Krishnendu Chatterjee; Laurent Doyen 001; Mickael Randour; Jean-François Raskin (Inf. Comput., 2015)

Reachability in Networks of Register Protocols under Stochastic Schedulers. - Patricia Bouyer; Nicolas Markey; Mickael Randour; Arnaud Sangnier; Daniel Stan (ICALP, 2016)

Non-Zero Sum Games for Reactive Synthesis. - Romain Brenguier; Lorenzo Clemente; Paul Hunter 001; Guillermo A. Pérez 001; Mickael Randour; Jean-François Raskin; Ocan Sankur; Mathieu Sassolas (LATA, 2016)

Window parity games: an alternative approach toward parity games with time bounds. - Véronique Bruyère; Quentin Hautem; Mickael Randour (GandALF, 2016)

Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version). - Véronique Bruyère; Quentin Hautem; Mickael Randour (CoRR, 2016)

Reconciling Rationality and Stochasticity: Rich Behavioral Models in Two-Player Games. - Mickael Randour (CoRR, 2016)

Bounding Average-Energy Games. - Patricia Bouyer; Piotr Hofman; Nicolas Markey; Mickael Randour; Martin Zimmermann 002 (FoSSaCS, 2017)

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. - Raphaël Berthon; Mickael Randour; Jean-François Raskin (ICALP, 2017)

Percentile queries in multi-dimensional Markov decision processes. - Mickael Randour; Jean-François Raskin; Ocan Sankur (Formal Methods Syst. Des., 2017)

Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. - Véronique Bruyère; Emmanuel Filiot; Mickael Randour; Jean-François Raskin (Inf. Comput., 2017)

Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. - Stéphane Le Roux 001; Arno Pauly; Mickael Randour (FSTTCS, 2018)

Multi-weighted Markov Decision Processes with Reachability Objectives. - Patricia Bouyer; Mauricio González; Nicolas Markey; Mickael Randour (GandALF, 2018)

Energy Mean-Payoff Games. - Véronique Bruyère; Quentin Hautem; Mickael Randour; Jean-François Raskin (CONCUR, 2019)

Simple Strategies in Multi-Objective MDPs (Technical Report). - Florent Delgrange; Joost-Pieter Katoen; Tim Quatmann; Mickael Randour (CoRR, 2019)

Simple Strategies in Multi-Objective MDPs. - Florent Delgrange; Joost-Pieter Katoen; Tim Quatmann; Mickael Randour (TACAS (1), 2020)

Games Where You Can Play Optimally with Finite Memory. - Patricia Bouyer; Stéphane Le Roux 001; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (CoRR, 2020)

Decisiveness of Stochastic Systems and its Application to Hybrid Models. - Patricia Bouyer; Thomas Brihaye; Mickael Randour; Cédric Rivière; Pierre Vandenhove (GandALF, 2020)

Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version). - Patricia Bouyer; Thomas Brihaye; Mickael Randour; Cédric Rivière; Pierre Vandenhove (CoRR, 2020)

Life is Random, Time is Not: Markov Decision Processes with Window Objectives. - Thomas Brihaye; Florent Delgrange; Youssouf Oualhadj; Mickael Randour (Log. Methods Comput. Sci., 2020)

Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. - James C. A. Main; Mickael Randour; Jeremy Sproston (CONCUR, 2021)

CONCUR Test-Of-Time Award 2022 (Invited Paper). - Ilaria Castellani; Paul Gastin; Orna Kupferman; Mickael Randour; Davide Sangiorgi (CONCUR, 2022)

Timed Games with Bounded Window Parity Objectives. - James C. A. Main; Mickael Randour; Jeremy Sproston (FORMATS, 2022)

The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). - Patricia Bouyer; Mickael Randour; Pierre Vandenhove (FSTTCS, 2022)

Interviews with the 2022 CONCUR Test-of-Time Award Recipients. - Luca Aceto; Orna Kupferman; Mickael Randour; Davide Sangiorgi (Bull. EATCS, 2022)

Games Where You Can Play Optimally with Arena-Independent Finite Memory. - Patricia Bouyer; Stéphane Le Roux 001; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2022)

Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). - Thomas Brihaye; Aline Goeminne; James C. A. Main; Mickael Randour (FSTTCS, 2023)

How to Play Optimally for Regular Objectives? - Patricia Bouyer; Nathanaël Fijalkow; Mickael Randour; Pierre Vandenhove (ICALP, 2023)

Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). - Patricia Bouyer; Antonio Casares; Mickael Randour; Pierre Vandenhove (IJCAI, 2023)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

Arena-Independent Finite-Memory Determinacy in Stochastic Games. - Patricia Bouyer; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2023)

Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. - Patricia Bouyer; Mickael Randour; Pierre Vandenhove (TheoretiCS, 2023)

Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions. - James C. A. Main; Mickael Randour (Inf. Comput., 2024)

Half-Positional Objectives Recognized by Deterministic Büchi Automata. - Patricia Bouyer; Antonio Casares; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2024)

Taming Infinity One Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs. - Michal Ajdarów; James C. A. Main; Petr Novotný 001; Mickael Randour (ICALP, 2025)

Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective MDPs and its Impact on Randomised Strategies. - James C. A. Main; Mickael Randour (CoRR, 2025)