About Me
I am a researcher in theoretical computer science, currently post-doc at the Institute of Science and Technology Austria, in the group lead by Thomas A. Henzinger. I hold a Master's degree from ENS Paris-Saclay, and a PhD from Université libre de Bruxelles, realised under the supervision of Jean-François Raskin and Marie van den Bogaard. My research focuses on game theory, with applications to formal verification and synthesis of reactive systems, secure protocols, and multi-agent systems.
Pronouns: He/him
Reach out to me in: French (native), English, Spanish/Castilian, Dutch, German
Research
Games are a convenient abstract model for the interaction of several agents with different objectives. In computer science, they are typically used to model the interaction between a computer-controlled system and its environment: if one wishes to program the system so that it enforces some property, one usually needs to synthesise a strategy that guarantees the property against any possible behavior of the environment. I usually consider more sophisticated settings, with more than two players, in order to model multi-agent systems. All my publications can be found on my DBLP page.
My PhD thesis: L. Brice, Equilibria in Multiplayer Graph Games: An Algorithmic Study (ULB).
Some other open problems I am interested in:
- What is the complexity of the constrained existence problem of SPEs in Büchi games? (We have shown that it was NP-complete in the case of parity games, and even of co-Büchi games, but this case remains open.)
- Conjecture: for every positive ε, in every mean-payoff game, there exists a (possibly randomised) ε-SPE. (This result is known in the case of terminal reward games, and I believe it can be extended to Büchi games.)
- Are there always Nash equilibria in a dicey game? What is the complexity of their constrained existence problem?
These are problems I'm currently not working on, but I'll be happy to collaborate with anyone wishing to adress them.
Teaching
I have been teaching assistant of the following courses:
- Computability and Complexity (Master, ULB, 2021-2025)
- Introduction to Language Theory and Compiling (Master, ULB, 2022-2024)
- Algorithmics 2 (Bachelor, ULB, 2024-2025)
Contact
You have questions on my works, or you want to start a collaboration? Feel free to reach out!
- Email: leonard.brice@ist.ac.at
- ORCID: 0000-0001-7748-7716
- Google Scholar: Profile