Pieter Kleer

According to our database, Pieter Kleer authored at least 20 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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

Georgios Amanatidis, Pieter Kleer

SIAM J. Discret. Math., 2024

2023

Secretary and online matching problems with machine learned advice.

Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev

Discret. Optim., May, 2023

Price of anarchy for parallel link networks with generalized mean objective.

Pieter Kleer

OR Spectr., March, 2023

Primal and dual combinatorial dimensions.

Pieter Kleer, Hans Simon

Discret. Appl. Math., 2023

2022

Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices.

Georgios Amanatidis, Pieter Kleer

SIAM J. Discret. Math., 2022

Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.

Georgios Amanatidis, Pieter Kleer, Guido Schäfer

Math. Oper. Res., 2022

Optimal Stopping Theory for a Distributionally Robust Seller.

Pieter Kleer, Johan van Leeuwaarden

CoRR, 2022

2021

Computation and efficiency of potential function minimizers of combinatorial congestion games.

Pieter Kleer, Guido Schäfer

Math. Program., 2021

Sampling hypergraphs with given degrees.

Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie

Discret. Math., 2021

Sampling from the Gibbs Distribution in Congestion Games.

Pieter Kleer

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Rapid mixing of the switch Markov chain for strongly stable degree sequences.

Georgios Amanatidis, Pieter Kleer

Random Struct. Algorithms, 2020

Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.

Pieter Kleer, Viresh Patel, Fabian Stroh

Electron. J. Comb., 2020

2019

Tight inefficiency bounds for perception-parameterized affine congestion games.

Pieter Kleer, Guido Schäfer

Theor. Comput. Sci., 2019

The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games.

Pieter Kleer, Guido Schäfer

Theory Comput. Syst., 2019

Topological Price of Anarchy Bounds for Clustering Games on Networks.

Pieter Kleer, Guido Schäfer

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices.

Georgios Amanatidis, Pieter Kleer

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence.

Corrie Jacobien Carstens, Pieter Kleer

Proceedings of the Approximation, 2018

2017

Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals.

Corrie Jacobien Carstens, Pieter Kleer

CoRR, 2017

Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation.

Pieter Kleer, Guido Schäfer

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games.

Pieter Kleer, Guido Schäfer

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017