In the prophet inequality problem, a gambler faces a sequence of items arriving online with
values drawn independently from known distributions. On seeing an item, the gambler must …

The secretary problem is probably the most well-studied optimal stopping problem with
many applications in economics and management. In the secretary problem, a decision …

In the classical prophet inequality, a gambler faces a sequence of items, whose values are
drawn independently from known distributions. Upon the arrival of each item, its value is …

There is growing awareness and concern about fairness in machine learning and algorithm
design. This is particularly true in online selection problems where decisions are often …

The value maximization version of the secretary problem is the problem of hiring a candidate
with the largest value from a randomly ordered sequence of candidates. In this work, we …

This work introduces sharding and Poissonization as a unified framework for analyzing
prophet inequalities. Sharding involves splitting a random variable into several independent …

We study online contention resolution schemes (OCRSs) and prophet inequalities for non-
product distributions. Specifically, when the active set is sampled according to a pairwise …

We study the classic single-choice prophet inequality problem through a resource
augmentation lens. Our goal is to bound the (1-ε)-competition complexity of different types of …

We study the competition complexity of dynamic pricing relative to the optimal auction in the
fundamental single-item setting. In prophet inequality terminology, we compare the expected …

The prophet inequality is one of the cornerstone problems in optimal stopping theory and
has become a crucial tool for designing sequential algorithms in Bayesian settings. In the iid …