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 Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

Congestion Games Mathematics
Price of Anarchy Mathematics
Game Mathematics
Game theory Engineering & Materials Science
Cost Sharing Mathematics
Cost functions Engineering & Materials Science
Externalities Mathematics
Approximation algorithms Engineering & Materials Science

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

Research Output 2012 2018

  • 11 Article
  • 1 Conference contribution

Tight inefficiency bounds for perception-parameterized affine congestion games

Kleer, P. & Schäfer, G., 24 Apr 2018, In : Theoretical Computer Science. p. 1-23 23 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Congestion Games
Price of Anarchy
Cost functions
Cost Function

Coordination games on graphs

Apt, K. R., de Keijzer, B., Rahn, M., Schäfer, G. & Simon, S., 1 Aug 2017, In : International Journal of Game Theory. 46, 3, p. 851-877 27 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Graph in graph theory
Price of Anarchy

Efficient Cost-Sharing Mechanisms for Price-Collecting Problems

Gupta, A., Könemann, J., Leonardi, S., Ravi, R. & Schäfer, G., 2015, In : Mathematical Programming. 152, 1-2, p. 147-188

Research output: Contribution to JournalArticleAcademicpeer-review

Cost Sharing
Cost functions
Cost Function

Inefficiency of Games with Social Context

Anagnostopoulos, A., Becchetti, L., de Keijzer, B. & Schäfer, G., 2015, In : Theory of Computing Systems. 57, 3, p. 782-804

Research output: Contribution to JournalArticleAcademicpeer-review

Game theory
Price of Anarchy
Algorithmic Game Theory

The Strong Price of Anarchy of Linear Bottleneck Congestion Games

de Keijzer, B., Schäfer, G. & Telelis, O., 2015, In : Theory of Computing Systems. 57, 2, p. 377-396

Research output: Contribution to JournalArticleAcademicpeer-review

Congestion Games
Price of Anarchy
Resource allocation