Chair: Miklos Pinter (University of Pécs and Corvinus University of Budapest)
Vice Chair: Eilon Solan (Tel-Aviv University)
Develop the foundations for a new theory of games played in continuous time. Develop a theory for dynamic network congestion games with uncertainty. Develop numerical algorithms for such games. Identify favourable instances of stochastic games admitting polynomial-time algorithms.