April 16 to 20 we will host Alexander Skopalik and Matthias Feldotto of the Algorithm and Complexity group at the University of Paderborn. Their work focuses on algorithmic game theory, in particular on the analysis of congestion games and on computing approximate equilibria in strategic games.
