Full name: Guido Schäfer
Formal name: Prof.dr. G. Schäfer
Function: Scientific Staff Member

Telephone: +31(0)20 592 4165
Room: M235
Homepage:  http://homepages.cwi.nl/~schaefer/
Research groups: Networks and Optimization

Research

Guido Schäfer's main research interests are algorithms and combinatorial optimization in general, and algorithmic game theory in particular. In his research, he attempts to unite ideas from operations research, optimization, algorithms, complexity and game theory with the goal to addresses real-world aspects that are of practical relevance (such as lack of coordination, data uncertainty, limited resources). Results of this research find their applications for instance in traffic, network routing and auctions.

Career

2013	Scientific staff member PNA1 - Algorithms, Combinatorics and Optimization
2013 -	Scientific staff member N&O - Networks and optimization
2012	Scientific staff member PNA1 - Algorithms, Combinatorics and Optimization
2010 -	Professor of Algorithmic Game Theory - Department of Econometrics and Operations Research, VU University Amsterdam
2009 - 2011	Scientific staff member/tenure track PNA1 - Algorithms, Combinatorics and Optimization
2005 - 2008	Head of the independent research group Discrete Optimization - Matheon - Institute of Mathematics, TU Berlin

Selected Academic Activities

2012	Member of program committee Valencia, Spain - ACM Conference on Electronic Commerce - [EC]
2012	Member of program committee Liverpool, UK - Workshop on Internet and Network Economics - [WINE]
2012	Cluster chair Berlin, Germany - International Symposium on Mathematical Programming - [ISMP] - Game Theory Cluster Chair
2011	Organizer Dutch Network on Computational Game Theroy - [DNETCG]
2011	Invited professor Sapienza University of Rome - [Sapienza] - Visiting Professor at Sapienza University of Rome, May-July, 2011
2010	Organizer CWI, Amsterdam, The Netherlands - Workshop on Advances in Algorithmic Game Theory
2010	Lecturer Max Planck Institute for Informatics - Advanced Course on the Foundations of Computer Science (ADFOCS)

Selected Publications

B. de Keijzer, G. Schäfer. Finding social optima in congestion games with positive externalities.. Proceedings of International Workshop on Internet And Network Economics 2012, 395–406, 2012.

K.R. Apt, G. Schäfer. Selfishness level of strategic games. Proceedings of International Symposium on Algorithmic Game Theory 2012 (5), Lecture Notes in Computer Science 7615, 13–24, 2012.

V. Bonifaci, M. Salek, G. Schäfer. Efficiency of Restricted Tolls in Non-atomic Network Routing Games. Proceedings of Symposium on Algorithmic Game Theory 2011, Amalfi, Italy, 302–313, 2011.

P.A. Chen, B. de Keijzer, D. Kempe, G. Schäfer. The Robust Price of Anarchy of Altruistic Games. Proceedings of International Workshop on Internet And Network Economics 2011, Singapore, 383–390, 2011.

A. Berger, V. Bonifaci, F. Grandoni, G. Schäfer. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Mathematical Programming 128, 355–372, 2011.

L. Fleischer, J. Könemann, S. Leonardi, G. Schäfer. Strict cost sharing schemes for Steiner forest. SIAM Journal on Computing 39, 3616–3632, 2010.

V. Bonifaci, T. Harks, G. Schäfer. Stackelberg routing in arbitrary networks. Mathematics of Operations Research 35, 330–346, 2010.

All publications (link to repository)