Dietmar Berwanger
Researcher, CNRS
Mail: dwb@lmf.cnrs.fr
Phone: +33 (0)1 81 87 54 42
Office: 2S59, Bâtiment ENS - Nord
Laboratoire Méthodes Formelles (LMF)
Université Paris-Saclay, CNRS, ENS Paris-Saclay
4 avenue des Sciences • 91190 Gif-sur-Yvette, France
About Me
I am a CNRS researcher in formal methods and game theory, with a background in logic and finite model theory. My work focuses on strategic coordination in systems with imperfect or evolving information, especially in relation to signalling and infinite-duration games.
At the Laboratoire Méthodes Formelles (LMF), I am leading the Modelling Cluster Pôle Modèles. I serve on the French Steering Committee of the STACS conference.
Game Theory and Language Workshop
The first edition of the Paris Game Theory Festival will take place from 2 to 7 June 2025 to bring together a community working on game theory and related disciplines.
I am co-organising the workshop Game Theory and Language, held on 5–7 June 2025 at Université Paris-Panthéon-Assas, on the theme Evolutionary Dynamics and Iterative Processes.
Internship Offers
- Faithful Nash Equilibria in Games over Graphs
M1–M2 internship on eliminating non-credible threats in infinite games, beyond subgame perfection. - Synthesis of Signalling Strategies in Distributed Networks
M1–M2 internship on information transmission and synthesis in distributed architectures.
The M2 internship proposals can be extended to a PhD project.
Working Paper
Synthesising Full-Information Protocols
We study a communication model where processes reveal all their local information whenever they interact — but an indeterminate environment controls when and with whom these interactions occur. This yields systems where a process may receive unbounded information at once.
In a setting modelled by synchronous games with imperfect information on finite graphs, we give a decision procedure for the synthesis of a process against fixed peers and an ω-regular specification. The key difficulty lies in constructing a finite representation of information trees with unbounded branching. Our procedure is non-elementary, and we prove a matching lower bound for the complexity of the synthesis problem.
→ Download the working paper (PDF)