Benjamin BORDAIS
PhD Student
Since September 1st, 2020, I am a PhD student under the supervision of
Patricia BOUYER and
Stéphane LE ROUX. My domain of research is game theory, more specifically, concurrent games on graphs. I am especially interested in how we can restrict the local interactions appearing in games to obtain the largest class of concurrent games (in a specific sense) that enjoy a given kind of desirable property (e.g. existence of optimal strategies in reachability games).
List of my publications
In the scope of my PhD
[Accepted FoSSaCs 2023] B. Bordais, P. Bouyer, S. Le Roux
Subgame optimal strategies in finite concurrent games with prefix-independent objectives.
[FSTTCS 2022] B. Bordais, P. Bouyer, S. Le Roux
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games [Published Version] [Extended Version (arXiv)]
[CSL 2022] B. Bordais, P. Bouyer, S. Le Roux
Optimal strategies in concurrent reachability games [Published Version] [Extended version (arXiv)]
[FSTTCS 2021] B. Bordais, P. Bouyer, S. Le Roux
From local to global determinacy in concurrent graph games [Published version] [Extended version (arXiv)]
Outside the scope of my PhD
[ICALP 2022] B. Bordais, D. Busatto-Gaston, S. Guha, J-F. Raskin.
Strategy Synthesis for Global Window PCTL [Published version] [ Extended version (arXiv)].
[FSTTCS 2019] B. Bordais, S. Guha, J-F. Raskin.
Expected Window Mean Payoff [Published version] [Extended version (arXiv)].
[RSSRail 2019] N. Bertrand, B. Bordais, L. Hélouët, T. Mari, J. Parreaux, O. Sankur.
Performance Evaluation of Metro Regulations Using Probabilistic Model-checking [pdf].
Teaching (2021-2022)
Advanced Complexity - M1 - MPRI (English)
Complexity - L3 - French
Algorithmics - L3 - French
Teaching (2020-2021)
Advanced Complexity - M1 - MPRI (English)
Complexity - L3 (French)