Yossi Azar Tel-Aviv University Coordination Mechanism and Search Problems |
Tim Roughgarden Stanford University Approximation Guarantees in Algorithmic Game Theory |
David B. Shmoys Cornell University Approximation Algorithms for Stochastic Optimization Problems |
ADFOCS is organized by Nicole Megow and Daniel Johannsen as part of the activities of the Algorithms and Complexity Group and the International Max Planck Research School of the Max Planck Institute for Informatics.
The purpose of the ADFOCS summer school is to introduce young researchers to topics which are in the focus of current research in the field of theoretical computer science. In order to achieve this, ADFOCS brings together leading researchers from this field with international participants of graduate level and above.
For questions please send email to adfocs@mpi-inf.mpg.de.