I am co-supervised by Thomas Brihaye in the Department of Mathematics of the University of Mons (UMONS), Véronique Bruyère in the Computer Science Departement of the University of Mons, and Jean-François Raskin in the Computer Science Department of the Université libre de Bruxelles (ULB).

My research interests lie in the field of Game Theory. In particular, I am interested in the synthesis of equilibria in multi-player non-zero sum games (e.g., Nash Equilibria, Subgame Perfect Equilibria and weak Subgame Perfect Equilibria).


  • On Relevant Equilibria in Rechability Games: Thomas Brihaye, Véronique Bruyère, Aline Goeminne and Nathan Thomasset, RP'19. [Extended version on arXiv] [Abstract].
  • The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games: Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin and Marie van den Bogaard, CONCUR'19, [Extended version on arXiv] [Abstract].
  • Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-regular Boolean Objectives: Thomas Brihaye, Véronique Bruyère, Aline Goeminne and Jean-François Raskin, GandALF'18 [Extended version on arXiv] [Abstract].

Attended events

  • 2019: HIGHLIGHTS'19 (Warsaw, Poland ), RP'19 (Bruxelles, Belgium), CONCUR'19 (Amsterdam, Netherlands), Theory and Algorithms in Graph and Stochastic Games (Mons, Belgium), Mardi des Chercheurs 2019 (Mons, Belgium).
  • 2018: GandALF 2018 (Saarbrücken, Germany), HIGHLIGHTS 2018 (Berlin, Germany), MOVEP (ENS Cachan, France), MoRe at FLoC 2018 (University of Oxford, UK), Logic and learning at FoPPS 2018 (University of Oxford, UK), GT Verif 2018 (VERIMAG, Grenoble, France) .
  • 2017: HIGHLIGHTS 2017 (London, UK) .
My talks (with slides).


Calculability and complexity

Teaching Assistant
4th year
September 2019 - Present
I give exercise sessions of the "Calculability and complexity" course (ULB) given by Jean-François Raskin.

Mathématiques effectives

Teaching Assistant
Maths: 4th year
September 2018 - Present
I give exercise sessions of the "Mathématiques effectives" course - a course about Game Theory given by Thomas Brihaye.

Introductory research internship

Gaëtan Staquet - Computer Science: 3rd year
August 2018


Master's thesis

Université de Mons (UMONS)
  • Subject: "Equilibres de Nash dans les jeux sur graphe : approche algorithmique" (Nash equilibria in graph games: algorithmic approach).
  • Directors: Thomas Brihaye and Véronique Bruyère.

Research internship

Université libre de Bruxelles (ULB)
October 2016 - December 2016
  • Subject: I implemented, using the concept of antichains, a well-known algorithm in formal verification to solve the tasks scheduling problem.
  • Supervisor: Gilles Geeraerts.

Master's project

Université de Mons (UMONS)
  • Subject: "Objectif d'atteignabilité et équilibres de Nash dans les jeux sur graphe " (Reachability objective and Nash equilibria in graph games).
  • Directors: Thomas Brihaye and Hadrien Mélot.