dr.ir. Pieter Kleer

Bio

I completed my PhD research at CWI in Amsterdam, the Netherlands, under the supervision of Guido Schäfer. After that I was a postdoctoral researcher at the Max Planck Institute for Informatics in Saarbrücken, Germany, in the group of Kurt Mehlhorn. I completed my Bachelor and Master studies at the TU Delft. In April 2021, I joined Tilburg University.

A copy of my CV (January 2022) can be found here.

Expertise

Algorithmic game theory, (online) approximation algorithms, MCMC methods for approximate sampling and counting.

Courses

• Computational Aspects in Econometrics
• Linear Optimization
• Orientation Research Topics in Operations Research (CentER)
• Linear Optimization for Data Science

Recent publications

1. Price of anarchy for parallel link networks with generalized mean obj…

   Kleer, P. (2023). Price of anarchy for parallel link networks with generalized mean objective. OR Spektrum, 45, 27-55.

2. Budget-feasible mechanism design for non-monotone submodular objectiv…

   Amanatidis, G., Kleer, P., & Schäfer, G. (2022). Budget-feasible mechanism design for non-monotone submodular objectives: Offline and online. Mathematics of Operations Research, 47(3), 2286-2309.

3. Rapid mixing of the switch Markov chain for 2-class joint degree matr…

   Amanatidis, G., & Kleer, P. (2022). Rapid mixing of the switch Markov chain for 2-class joint degree matrices. SIAM Journal on Discrete Mathematics, 36(1), 118-146.

4. Sampling from the Gibbs distribution in congestion games

   Kleer, P. (Accepted/In press). Sampling from the Gibbs distribution in congestion games. Mathematics of Operations Research.

5. Approximate Sampling and Counting of Graphs with Near-Regular Degree …

   Amanatidis, G., & Kleer, P. (2021). Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. (ArXiv; Vol. 2110.09068). Cornell University Library. https://arxiv.org/abs/2110.09068