If you made any changes in Pure these will be visible here soon.

Personal profile

Personal information

Extraordinary Professor: since January 2010 Guido Schaefer is holding a "bijzondere leerstoel" on "Algorithmic Game Theory" at the Department of Econometrics and Operations Research.

He joined the Networks and Optimization (N&O) group at Centrum Wiskunde & Informatica (CWI) as a senior researcher in 2009. Since September 2016 he is the group leader of the Networks and Optimization (N&O) group.

He obtained his PhD in 2004 at the Max-Planck-Institute for Informatics, Saarbrucken, Germany.


My main research interests are algorithms and combinatorial optimization in general, and algorithmic game theory in particular.

A large part of my research is concerned with the development of efficient algorithms for optimization problems. Another part is about devising algorithmic means to reduce the inefficiency caused by selfish behavior in large distributed systems. My research is fundamental in nature, but addresses several real-world aspects that are of practical relevance (such as lack of coordination, uncertainty of data, limitations of resources).

Results of this research find their applications, for instance, in logistics, transportation, traffic and network routing, scheduling and auctions.


In fall 2016, I taught a Master Course on Algorithmic Game Theory at the Vrije Universiteit Amsterdam and a course on Discrete Mathematics at Amsterdam University College (together with D. Dadush and M. Laurent). These courses will be offered again in fall 2017.

In spring 2016, I taught a PhD course on Algorithmic Game Theory, which is part of the PhD program of the Dutch Network on the Mathematics of Operations Research (LNMB).

Ancillary activities

No ancillary activities

Ancillary activities are updated daily

Fingerprint Dive into the research topics where Guido Schäfer is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

Congestion Games Mathematics
Price of Anarchy Mathematics
Game Mathematics
Costs Engineering & Materials Science
Network routing Engineering & Materials Science
Latency Mathematics
Deviation Mathematics
Cost functions Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2012 2019

Budget-feasible mechanism design for non-monotone submodular objectives: Offline and online

Amanatidis, G., Kleer, P. & Schäfer, G., 17 Jun 2019, ACM EC 2019 - Proceedings of the 2019 ACM Conference on Economics and Computation. Association for Computing Machinery, Inc, p. 901-919 19 p.

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Mechanism Design
Polynomial time

The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games

Kleer, P. & Schäfer, G., 15 Jan 2019, In : Theory of Computing Systems. 63, 1, p. 54-89 36 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Network routing

Tight inefficiency bounds for perception-parameterized affine congestion games

Kleer, P. & Schäfer, G., 6 Jan 2019, In : Theoretical Computer Science. 754, p. 65-87 23 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Congestion Games
Price of Anarchy
Cost functions
Cost Function

When Nash met Markov: Novel results for pure Nash equilibria and the switch Markov chain

Kleer, P. S., 2019, 208 p.

Research output: PhD ThesisPhD Thesis - Research VU, graduation VUAcademic

Open Access

On the effectiveness of connection tolls in fair cost facility location games

Rodrigues, F. C., Schäfer, G. & Xavier, E. C., 2018, Italian Conference on Theoretical Computer Science: Proceedings of the 19th Italian Conference on Theoretical Computer Science. Urbino, Italy, September 18-20, 2018.. Aldini, A. & Bernardo, M. (eds.). p. 36-47 12 p. (CEUR Workshop Proceedings; vol. 2243).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review