Summary
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).
Publications
Preprints
Conferences
- On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games:Thomas Brihaye and Aline Goeminne, FORMATS'20. [Preprint on arXiv] [Abstract].
- On Relevant Equilibria in Reachability 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].
Journals
- Constrained Existence of weak Subgame Perfect Equilibria in Multiplayer Büchi games: Aline Goeminne, Information Processing Letters Volume 163, November 2020. [Abstract].
- [Special issue] 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, to appear in Information and Computation.
Attended events
- 2020: MOVEP (Online),
- 2019: Grascomp Doctoral Day (GDD’19) (Namur, Belgium), 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) .
Teaching
I give exercise sessions of the "Calculability and complexity" course (ULB) given by Jean-François Raskin.
I give exercise sessions of the "Mathématiques effectives" course - a course about Game Theory given by Thomas Brihaye.
- Gaëtan Staquet -- August 2018
- Subject: "Algorithmes efficaces pour le calcul d'équilibres de Nash".
- Other co-supervisors: Thomas Brihaye, Véronique Bruyère and Hadrien Mélot.
- Nicolas Lecomte -- August 2020
- Subject: "Théorie des perspectives et théorie des jeux ".
- Other co-supervisor: Thomas Brihaye
Miscellaneous
- 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.
- Subject: I implemented, using the concept of antichains, a well-known algorithm in formal verification to solve the tasks scheduling problem.
- Supervisor: Gilles Geeraerts.
- 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.