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

Recent publications

  1. 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.
  2. 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
  3. Sampling hypergraphs with given degrees

    Dyer, M., Greenhill, C., Kleer, P., Ross, J., & Stougie, L. (2021). Sampling hypergraphs with given degrees. Discrete Mathematics, 344(11), [112566].
  4. Primal and Dual Combinatorial Dimensions

    Kleer, P., & Simon, H. (2021). Primal and Dual Combinatorial Dimensions. (arXiv; Vol. 2108.10037). Cornell University Library. https://arxiv.org/abs/2108.10037
  5. Sampling from the Gibbs distribution in congestion games

    Kleer, P. (2021). Sampling from the Gibbs distribution in congestion games. In Proceedings of the 22nd ACM Conference on Economics and Computation (pp. 679–680). (EC '21). Association for Computing Machinery.

Find an expert or expertise