Working Group 3: Graph Games

Chair: Antonin Kucera (Masaryk University)

Vice-Chair: Krishnendu Chatterjee (IST Austria)

Main Aim: 

Design of efficient algorithmic for graph games with stochastic transitions, evolutionary games, and multi-agent systems, with a view towards their implementation for formal analysis of reactive systems


  1. Algorithms for graph games with stochastic transitions
  2. Algorithmic perspectives of evolutionary games on graphs
  3. Algorithmic approaches for multi-agent systems