Conference announcement: 30 Years of Game Theory at Institut Henri Poincaré, October 06-10, 2025, Paris.

Welcome

The Séminaire parisien de Théorie des Jeux is an open, inter-institutional, multi-disciplined seminar which covers all fields of game theory. It takes place on Monday from 11:00 to 12:00 am at Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème. MAP

You will find the program for the current academic year on the page 2025/2026 and the program for past years on the page Archives.

The junior seminar welcomes PhD students in game theory to present their work.  You will find the program for the current academic year on the page Junior Seminar 2025/2026.

Next seminar:  

February 16, 2026 (room Maryam Mirzakhani): 

Arkadi PREDTETCHINSKI (Maastricht University), 

Title: "Zero-one Laws for a Control Problem with Random Action Sets" with János Flesch, William D Sudderth, Xavier Venel

Abstract: In many control problems there is only limited information about the actions that will be available at future stages. We introduce a framework where the Controller chooses actions $a_{0}, a_{1}, \ldots$, one at a time. Her goal is to maximize the probability that the infinite sequence $(a_{0}, a_{1}, \ldots)$ is an element of a given subset $G$ of $\N^\N$. The set $G$, called the goal, is assumed to be a Borel tail set. The Controller's choices are restricted: having taken a sequence $h_{t} = (a_{0}, \ldots, a_{t-1})$ of actions prior to stage $t \in \N$, she must choose an action $a_{t}$ at stage $t$ from a non-empty, finite subset $A(h_{t})$ of $\N$. The set $A(h_{t})$ is chosen from a distribution $p_{t}$, independently over all $t \in \N$ and all $h_{t} \in \N^{t}$. We consider several information structures defined by how far ahead into the future the Controller knows what actions will be available. In the special case where all the action sets are singletons (and thus the Controller is a dummy), Kolmogorov’s 0-1 law says that the probability for the goal to be reached is 0 or 1. We construct a number of counterexamples to show that in general the value of the control problem can be strictly between 0 and 1, and derive several sufficient conditions for the 0-1 ``law" to hold.

Organizers

Frédéric Koessler (CNRS, HEC Paris), frederic.koessler[at]gmail[dot]com

Maël Letreust  (CNRS,  IRISA Rennes), mael.le-treust[at]cnrs[dot]fr

Chantal Marlats (LEMMA, Université Paris Panthéon-Assas), chantal.marlats[at]u-paris2[dot]fr

Yannick Viossat (CEREMADE, PSL), viossat[at]ceremade[dot]dauphine[dot]fr

To join (or unsuscribe from) our mailing list, please contact Chantal Marlats at chantal.marlats[at]assas-universite[dot]fr. 

Former organizers

Joseph Abdou; Bernard De Meyer; Françoise Forges; Olivier Gossner;  Marie Laclau; Rida Laraki; Lucie Ménager; Vianney Perchet; Jérôme Renault; Dinah Rosenberg; Sylvain Sorin; Tristan Tomala; Xavier Venel; Nicolas Vieille; Guillaume Vigeral; Bruno Ziliotto