Publications

Partial list on DBLP.

Books (1)

  • Games on Graphs. Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra. On arXiv (490 pages).

Invited papers in international peer-reviewed conferences (5)

  • Reachability Games and Friends: A Journey through the Lens of Memory and Complexity. Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour. Keynote lecture at FSTTCS’23, LIPIcs 284, 26 pages, Schloss Dagstuhl, 2023. Open access through DROPS (18 pages).
  • Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove. IJCAI’23 – Sister Conferences Best Papers Track, 2023. Extended version on arXiv (37 pages).
  • The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove. Keynote lecture at FSTTCS'22, LIPIcs 250, 18 pages, Schloss Dagstuhl, 2022. Open access through DROPS (18 pages).
  • Non-Zero Sum Games for Reactive Synthesis. Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas. Keynote lecture at LATA'16, LNCS 9618, 21 pages, Springer, 2016. On arXiv (21 pages).
  • Variations on the Stochastic Shortest Path Problem. Mickael Randour, Jean-François Raskin, Ocan Sankur. Keynote lecture at VMCAI'15, LNCS 8931, 18 pages, Springer, 2015. On arXiv (18 pages).

Peer-reviewed journals (10)

  • Arena-Independent Finite-Memory Determinacy in Stochastic Games. Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. Logical Methods in Computer Science, volume 19, issue 4, pages 18:1-18:51, 2023. On arXiv (51 pages).
  • Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove. TheoretiCS, volume 2, 48 pages, 2023. On arXiv (48 pages).
  • Decisiveness of Stochastic Systems and its Application to Hybrid Models. Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove. Information and Computation, volume 289, 25 pages, Elsevier, 2022. On arXiv (30 pages).
  • Games Where You Can Play Optimally with Arena-Independent Finite Memory. Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. Logical Methods in Computer Science, volume 18, issue 1, pages 11:1-11:44, 2022. On arXiv (34 pages).
  • Life is Random, Time is Not: Markov Decision Processes with Window Objectives. Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour. Logical Methods in Computer Science, volume 16, issue 4, pages 13:1-13:30, 2020. On arXiv (30 pages).
  • Average-energy games. Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen. Acta Informatica, volume 55, issue 2, pages 91-127, Springer, 2018. On arXiv (30 pages).
  • Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin. Information and Computation, volume 254, pages 259-295, Elsevier, 2017. Full version, 37 pages. On arXiv (45 pages).
  • Percentile Queries in Multi-Dimensional Markov Decision Processes. Mickael Randour, Jean-François Raskin, Ocan Sankur. Formal Methods in System Design, volume 50, issue 2, pages 207-248, Springer, 2017. Full version, 42 pages. On arXiv (35 pages).
  • Looking at Mean-Payoff and Total-Payoff through Windows. Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin. Information and Computation, volume 242, pages 25-52, Elsevier, 2015. Full version, 28 pages. On arXiv (32 pages).
  • Strategy Synthesis for Multi-Dimensional Quantitative Objectives. Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin. Acta Informatica, volume 51, issue 3-4, pages 129-163, Springer, 2014. Full version, 35 pages. On arXiv (28 pages).

International peer-reviewed conference proceedings (25)

  • How to Play Optimally for Regular Objectives? Patricia Bouyer, Nathanael Fijalkow, Mickael Randour, Pierre Vandenhove. ICALP'23, LIPIcs 261, 18 pages, Schloss Dagstuhl, 2023. Extended version on arXiv (26 pages).
  • Timed Games with Bounded Window Parity Objectives. James C. A. Main, Mickael Randour, Jeremy Sproston. FORMATS'22, LNCS 13465, 18 pages, Springer, 2022. Extended version on arXiv (44 pages).
  • Half-Positional Objectives Recognized by Deterministic Büchi Automata. Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove. CONCUR'22, LIPIcs 243, 18 pages, Schloss Dagstuhl, 2022. Extended version on arXiv (37 pages).
  • Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions. James C. A. Main, Mickael Randour. CONCUR'22, LIPIcs 243, 18 pages, Schloss Dagstuhl, 2022. Extended version on arXiv (28 pages).
  • Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove. STACS'22, LIPIcs 219, 16 pages, Schloss Dagstuhl, 2022. Extended version on arXiv (41 pages).
  • Arena-Independent Finite-Memory Determinacy in Stochastic Games. Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. CONCUR'21, LIPIcs 203, 18 pages, Schloss Dagstuhl, 2021. Extended version on arXiv (35 pages).
  • Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. James C. A. Main, Mickael Randour, Jeremy Sproston. CONCUR'21, LIPIcs 203, 16 pages, Schloss Dagstuhl, 2021. Extended version on arXiv (36 pages).
  • Decisiveness of Stochastic Systems and its Application to Hybrid Models. Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove. GandALF'20, EPTCS 326, 16 pages, 2020. Extended version on arXiv (30 pages).
  • Games Where You Can Play Optimally with Arena-Independent Finite Memory. Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. CONCUR'20, LIPIcs 171, 22 pages, Schloss Dagstuhl, 2020. Extended version on arXiv (34 pages).
  • Simple Strategies in Multi-Objective MDPs. Florent Delgrange, Joost-Pieter Katoen, Tim Quatmann, Mickael Randour. TACAS 2020, LNCS 12078, 19 pages, Springer, 2020. Extended version on arXiv (25 pages).
  • Energy mean-payoff games. Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin. CONCUR'19, LIPIcs 140, 17 pages, Schloss Dagstuhl, 2019. Extended version on arXiv (29 pages).
  • Life is Random, Time is Not: Markov Decision Processes with Window Objectives. Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour. CONCUR'19, LIPIcs 140, 18 pages, Schloss Dagstuhl, 2019. Extended version on arXiv (30 pages). Best paper award at CONCUR 2019.
  • Extending finite-memory determinacy by Boolean combination of winning conditions. Stéphane Le Roux, Arno Pauly, Mickael Randour. FSTTCS'18, LIPIcs 122, 21 pages, Schloss Dagstuhl, 2018. Extended version on arXiv (20 pages).
  • Multi-weighted Markov decision processes with reachability objectives. Patricia Bouyer, Mauricio González, Nicolas Markey, Mickael Randour. GandALF'18, EPTCS 277, 15 pages, 2018. On arXiv (15 pages).
  • Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. Raphaël Berthon, Mickael Randour, Jean-François Raskin. ICALP'17, LIPIcs 80, 14 pages, Schloss Dagstuhl, 2017. Extended version on arXiv (26 pages).
  • Bounding Average-energy Games. Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann. FoSSaCS'17, LNCS 10203, 17 pages, Springer, 2017. Extended version on arXiv (22 pages).
  • Window parity games: an alternative approach toward parity games with time bounds. Véronique Bruyère, Quentin Hautem, Mickael Randour. GandALF'16, EPTCS 226, 14 pages, 2016. Extended version on arXiv (25 pages).
  • Reachability in Networks of Register Protocols under Stochastic Schedulers. Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan. ICALP'16, LIPIcs 55, 14 pages, Schloss Dagstuhl, 2016. Extended version on arXiv (20 pages).
  • Average-energy games. Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen. GandALF'15, EPTCS 193, 15 pages, 2015. Extended version on arXiv (30 pages).
  • Percentile Queries in Multi-Dimensional Markov Decision Processes. Mickael Randour, Jean-François Raskin, Ocan Sankur. CAV'15, LNCS 9206, 17 pages, Springer, 2015. Extended version on arXiv (35 pages).
  • 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'14, EPTCS 146, 8 pages, 2014. On arXiv (8 pages).
  • Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin. STACS'14, LIPIcs 25, 15 pages, Schloss Dagstuhl, 2014. Extended version on arXiv (45 pages).
  • Looking at Mean-Payoff and Total-Payoff through Windows. Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin. ATVA'13, LNCS 8172, 15 pages, Springer, 2013. Extended version on arXiv (32 pages).
  • Strategy Synthesis for Multi-Dimensional Quantitative Objectives. Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin. CONCUR'12, LNCS 7454, 17 pages, Springer, 2012. Extended version on arXiv (27 pages).
  • Automated synthesis of reliable and efficient systems through game theory: a case study. Mickael Randour. ECCS'12, Springer Proceedings in Complexity XVII, 8 pages, Springer, 2013. On arXiv (8 pages).

International peer-reviewed conferences without proceedings (1)

  • Reconciling Rationality and Stochasticity: Rich Behavioral Models in Two-Player Games. Mickael Randour. GAMES 2016, the 5th World Congress of the Game Theory Society, 16 pages, 2016. On arXiv (16 pages).

Thesis

  • Synthesis in Multi-Criteria Quantitative Games. Mickael Randour. PhD thesis. Supervisors: V. Bruyère (UMONS) et J.-F. Raskin (ULB). Université de Mons (UMONS), 330 pages, 2014. Thesis.