Working Group 1: Algorithmic theory of network games

Chair: Agnes Cseh (Hasso Plattner Institute and Hungarian Academy of Sciences)

Vice-Chair: Daniel Schmand (Universität Bremen)

Main Aim: 

Develop an algorithmic theory of decision making for mechanism design and coordination mechanism design problems in the context of network applications. This working group will resort to classical algorithm design paradigms such as polynomial time approximation algorithms, as well as complexity theoretic lower bounds for the resulting optimization problems.


  1. Behavioural aspects of mechanism design with social network interaction.
  2. Algorithmic mechanism design (AMD) with multiple parameters.
  3. Coordination mechanisms for network resource allocation