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.

Vakken

• Lineaire Optimalisering
• Computational Aspects in Econometrics
• Linear Optimization for Data Science

Recente publicaties

1. Secretary and online matching problems with machine learned advice

   Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2023). Secretary and online matching problems with machine learned advice. Discrete Optimization, 48(part 2), Article 100778.

2. 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 Spectrum, 45(1), 27-55.

3. Primal and dual combinatorial dimensions

   Kleer, P., & Simon, H. (2023). Primal and dual combinatorial dimensions. Discrete Applied Mathematics, 327, 185-196.

4. Sampling from the Gibbs distribution in congestion games

   Kleer, P. (2023). Sampling from the Gibbs distribution in congestion games. Mathematics of Operations Research, 48(4), 1846-1870.

5. Topological bounds on the price of anarchy of clustering games on net…

   Kleer, P., & Schäfer, G. (2023). Topological bounds on the price of anarchy of clustering games on networks. ACM Transactions on Economics and Computation, 11(3-4), Article 11.