Pieter Kleer

42 papers A* 5A 1B 3C 1Journal 30Unranked 2
YearRankTypeTitle / Venue / Authors
2025 B conf
Bayesian Optimal Stopping with Maximum Value Knowledge.
SAGT
Pieter Kleer, Daan Noordenbos
2025 J jnl
Bayesian Optimal Stopping with Maximum Value Knowledge.
CoRR
Pieter Kleer, Daan Noordenbos
2025 J jnl
Robust Optimality of Bundling Goods Beyond Finite Variance.
CoRR
Tim S. G. van Eck, Pieter Kleer, Johan S. H. van Leeuwaarden
2024 J jnl
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals.
SIAM J. Discret. Math.
Georgios Amanatidis, Pieter Kleer
2023 A conf
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals.
STACS
Georgios Amanatidis, Pieter Kleer
2023 J jnl
Price of anarchy for parallel link networks with generalized mean objective.
OR Spectr.
Pieter Kleer
2023 J jnl
Primal and dual combinatorial dimensions.
Discret. Appl. Math.
Pieter Kleer, Hans Simon
2023 J jnl
Sampling from the Gibbs Distribution in Congestion Games.
Math. Oper. Res.
Pieter Kleer
2023 J jnl
Secretary and online matching problems with machine learned advice.
Discret. Optim.
Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev
2023 J jnl
Topological Bounds on the Price of Anarchy of Clustering Games on Networks.
ACM Trans. Economics and Comput.
Pieter Kleer, Guido Schäfer
2022 J jnl
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.
Math. Oper. Res.
Georgios Amanatidis, Pieter Kleer, Guido Schäfer
2022 J jnl
Optimal Stopping Theory for a Distributionally Robust Seller.
CoRR
Pieter Kleer, Johan van Leeuwaarden
2022 J jnl
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices.
SIAM J. Discret. Math.
Georgios Amanatidis, Pieter Kleer
2021 J jnl
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals.
CoRR
Georgios Amanatidis, Pieter Kleer
2021 J jnl
Computation and efficiency of potential function minimizers of combinatorial congestion games.
Math. Program.
Pieter Kleer, Guido Schäfer
2021 J jnl
Primal and Dual Combinatorial Dimensions.
CoRR
Pieter Kleer, Hans Simon
2021 A* conf
Sampling from the Gibbs Distribution in Congestion Games.
EC
Pieter Kleer
2021 J jnl
Sampling from the Gibbs Distribution in Congestion Games.
CoRR
Pieter Kleer
2021 J jnl
Sampling hypergraphs with given degrees.
Discret. Math.
Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
2020 J jnl
Rapid mixing of the switch Markov chain for strongly stable degree sequences.
Random Struct. Algorithms
Georgios Amanatidis, Pieter Kleer
2020 J jnl
Sampling hypergraphs with given degrees.
CoRR
Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
2020 A* conf
Secretary and Online Matching Problems with Machine Learned Advice.
NeurIPS
Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev
2020 J jnl
Secretary and Online Matching Problems with Machine Learned Advice.
CoRR
Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev
2020 J jnl
Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.
Electron. J. Comb.
Pieter Kleer, Viresh Patel, Fabian Stroh
2020 J jnl
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.
CoRR
Pieter Kleer, Viresh Patel, Fabian Stroh
2020 J jnl
Topological Price of Anarchy Bounds for Clustering Games on Networks.
CoRR
Pieter Kleer, Guido Schäfer
2019 A* conf
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online.
EC
Georgios Amanatidis, Pieter Kleer, Guido Schäfer
2019 J jnl
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online.
CoRR
Georgios Amanatidis, Pieter Kleer, Guido Schäfer
2019 A* conf
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices.
SODA
Georgios Amanatidis, Pieter Kleer
2019 J jnl
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games.
Theory Comput. Syst.
Pieter Kleer, Guido Schäfer
2019 J jnl
Tight inefficiency bounds for perception-parameterized affine congestion games.
Theor. Comput. Sci.
Pieter Kleer, Guido Schäfer
2019 — conf
Topological Price of Anarchy Bounds for Clustering Games on Networks.
WINE
Pieter Kleer, Guido Schäfer
2018 J jnl
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences.
CoRR
Georgios Amanatidis, Pieter Kleer
2018 — conf
Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence.
APPROX-RANDOM
Corrie Jacobien Carstens, Pieter Kleer
2017 J jnl
Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals.
CoRR
Corrie Jacobien Carstens, Pieter Kleer
2017 B conf
Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games.
SAGT
Pieter Kleer, Guido Schäfer
2017 J jnl
Path deviations outperform approximate stability in heterogeneous congestion games.
CoRR
Pieter Kleer, Guido Schäfer
2017 A* conf
Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation.
EC
Pieter Kleer, Guido Schäfer
2017 C conf
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games.
CIAC
Pieter Kleer, Guido Schäfer
2017 J jnl
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games.
CoRR
Pieter Kleer, Guido Schäfer
2016 B conf
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games.
SAGT
Pieter Kleer, Guido Schäfer
2016 J jnl
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games.
CoRR
Pieter Kleer, Guido Schäfer