activity
20162026
most citedSecretary and Online Matching Problems with Machine Learned Advice

8 citations · 10 across the 13 of their papers we have counts for

collaborators

17 papers

cs.DS2026

Personalised versus Posted Pricing from Samples

Pieter Kleer, Johan van Leeuwaarden, Daan Noordenbos

Personalised pricing maximises expected revenue from a market but requires detailed information about individual customers. How much of this revenue can be recovered using a simple…

math.OC2026

Sample-Based Prophet Inequalities for Random Walks

Pieter Kleer, Johan van Leeuwaarden, Daan Noordenbos

We study prophet inequalities for a random walk reward stopping problem with sample-based information. The goal is to stop as close as possible to the maximum of a random walk with…

math.OC2025

Bayesian Optimal Stopping with Maximum Value Knowledge

Pieter Kleer, Daan Noordenbos

We consider an optimal stopping problem with n correlated offers where the goal is to design a (randomized) stopping strategy that maximizes the expected value of the offer in the…

econ.TH2022★ 1 cited

Optimal Stopping Theory for a Distributionally Robust Seller

Pieter Kleer, Johan van Leeuwaarden

Sellers in online markets face the challenge of determining the right time to sell in view of uncertain future offers. Classical stopping theory assumes that sellers have full know…

cs.DM2021

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

Georgios Amanatidis, Pieter Kleer

The approximate uniform sampling of graphs with a given degree sequence is a well-known, extensively studied problem in theoretical computer science and has significant application…

math.CO2021

Primal and Dual Combinatorial Dimensions

Pieter Kleer, Hans Simon

We give tight bounds on the relation between the primal and dual of various combinatorial dimensions, such as the pseudo-dimension and fat-shattering dimension, for multi-valued fu…