Most of my research activities concern the algorithmic side of game theory and its applications in computer
science. At the moment, I am particularly interested in stochastic games with partial
I have proved several results about the existence of pure and stationary
optimal strategies in zero-sum stochastic games with perfect information
I have also worked on the approximability of parity games by multi-discounted
games and existence of Blackwell optimal strategies in these games
Beside their theoretical interests, these results have applications in
controller synthesis for discrete event systems and verification of programs.
A few years ago, I used to be interested in games played on transition graphs of pushdown
and I designed algorithms for solving parity and exploration games on this
kind of graphs .
These results provide new tools for the Model-Checking of programs with
- Member of Rhoban Project.
- PhD advisor of Edon Kelmendi (with François Dufour), Quentin
Rouxel (with Olivier Ly) and Ludovic Hofer (with Olivier Ly). Formerly, PhD advisor of Youssouf Oualhadj (with Anca Muscholl).
Perfect-Information Stochastic Mean-Payoff Parity Games
co-authored with Krishnendu Chatterjee, Laurent Doyen and Youssouf Oualhadj.
Accepted for FOSSACS'14.
Deciding the Value 1 Problem for #-acyclic Partially Observable Markov Decision Processes
co-authored with Youssouf Oualhadj. Accepted for SOFSEM'13.
Asynchronous Games over Tree Architectures
co-authored with Blaise Genest, Anca Muscholl and Igor Walukiewicz. Accepted for ICALP'13.
A Class of Probabilistic Automata with a Decidable Value 1 Problem,
Youssouf Oualhadj. Accepted for LICS'12.
Subgame Perfection for Equilibria in Quantitative Reachability Games,
co-authored with Thomas Brihaye, Véronique Bruyère and Julie De Pril. Accepted for FOSSACS'12.
Blackwell-Optimal Strategies in Priority Mean-Payoff Games, co-authored with Wieslaw Zielonka.
Accepted for Gandalf'2010. Selected for the journal special issue.
Randomness for Free
, co-authored with Krishnendu Chatterjee, Laurent Doyen and Thomas Henzinger. Accepted for MFCS'10.
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
, co-authored with Blaise Genest, Anca Muscholl and Igor Walukiewicz. Accepted for ICALP'10.
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
, co-authored with Youssouf Oualhadj. Accepted for ICALP'10.
Solving Simple Stochastic Tail Games
, co-authored with Florian Horn. Accepted for SODA'10.
Solving Simple Stochastic Games with Few Random Vertices
co-authored with Florian Horn. LMCS, vol. 5(2), special issue of FOSSACS'08.
The conference version is 
Qualitative Determinacy and Decidability of Stochastic Games with Signals,
co-authored with Nathalie Bertrand and Blaise Genest. Accepted for LICS'09.
"Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games, in
"Logic and Automata: History and Perspectives. Volume 2 of Texts in Logic and Games, pages 331-355, 2007. Amsterdam University Press.
"Simple Stochastic Games with Few Random Vertices are Easy to
, co-authored with Florian Horn. Accepted for FOSSACS'08.
"Perfect Information Stochastic Priority Games"
, co-authored with Wiesław Zielonka. Accepted for ICALP'07.
"Limits of Multi-Discounted Markov Decision Processes"
, co-authored with Wiesław Zielonka. Accepted for LICS'07.
"Pure stationary optimal strategies in Markov decision processes"
. Accepted for STACS'07.
"Deterministic Priority Mean Payoff Games as Limits of Discounted Games"
, co-authored with Wiesław Zielonka. Accepted for ICALP'06.
"Discounting Infinite Games, but How and Why ?"
, co-authored with Wiesław Zielonka. Invited paper for GDV'04.
"Games Where You Can Play Optimally Without Any Memory"
, co-authored with Wiesław Zielonka. Accepted for CONCUR'05.
"When can you play positionally ?"
, co-authored with Wiesław Zielonka. Accepted for MFCS'04.
"Parity and Exploration Games on Infinite Graphs"
, Accepted for CSL'04.
I used to be a PhD student under the supervision of
If you can read french and if you are interested in game theory, then have a look at my PhD thesis:
- Stamina is a tool which computes
stabilization monoids, compute star-height of regular languages, decide the value 1 problem for probabilistic
automata or decide whether a counter-automaton is bounded.
The code, mostly C++.
- Marmotte is a website that
dematerializes most of the tasks of members
National de la Recherche Scientifique
(CNRS competition, evaluation of research units and researchers, expertise)
and improves the diffusion of
information among the Comité National.
The code, mostly php.
- The Rhoban project is a good
opportunity to produce some real-time algorithms for image
processing and robotic control, and play
soccer. Rhoban System
is the eponym Spin-off of LaBRI in which the algorithms are adapted
to solve real-world problems and developp smart systems for agriculture.
Rodin tutorials in M2 of Saigon
Homepage for the
ENSEIRB course "Théorie des jeux pour la modélisation
for tutorials I used to give
in game theory, information theory, system, java
My CV is available here
About quantitative evaluation of research
Two convincing critics of evaluation of publications and researchers using impact factors, h-numbers and so on...
A technical one, in french, written by INRIA computer scientists.
Another one, "The Mismeasurement of Science" less technical and more acid, written by a Cambridge biologist.
The mitigated opinion of the french academy of science.
If you are interested in humanoid robots and precision agriculture, here is the webpage of
Rhoban project and also the world famous Metabot, a cheap robot for education, research and fun.