English
Related papers

Related papers: Sample-driven optimal stopping: From the secretary…

200 papers

We study the prophet secretary problem, a well-studied variant of the classic prophet inequality, where values are drawn from independent known distributions but arrive in uniformly random order. Upon seeing a value at each step, the…

Computer Science and Game Theory · Computer Science 2023-05-19 Paul Dütting , Evangelia Gergatsouli , Rojin Rezvan , Yifeng Teng , Alexandros Tsigonias-Dimitriadis

We study a variant of the single-choice prophet inequality problem where the decision-maker does not know the underlying distribution and has only access to a set of samples from the distributions. Rubinstein et al. [2020] showed that the…

Computer Science and Game Theory · Computer Science 2024-09-04 Tomer Ezra

In the classical optimal stopping problem, a player is given a sequence of random variables $X_1\ldots X_n$ with known distributions. After observing the realization of $X_i$, the player can either accept the observed reward from $X_i$ and…

Discrete Mathematics · Computer Science 2020-07-24 Shipra Agrawal , Jay Sethuraman , Xingyu Zhang

The prophet and secretary problems demonstrate online scenarios involving the optimal stopping theory. In a typical prophet or secretary problem, selection decisions are assumed to be immediate and irrevocable. However, many online settings…

Computer Science and Game Theory · Computer Science 2019-11-07 Tomer Ezra , Michal Feldman , Ilan Nehama

This paper considers a finite horizon optimal stopping problem for a sequence of independent and identically distributed random variables, where the objective is to design stopping rules that attempt to select the random variable with the…

Probability · Mathematics 2026-05-20 Alexander Goldenshluger , Yaakov Malinovsky , Assaf Zeevi

For $2\le k\in\mathbb{N}$, consider the following adaptation of the classical secretary problem. There are $k$ items at each of $n$ linearly ordered ranks. The $kn$ items are revealed, one item at a time, in a uniformly random order, to an…

Probability · Mathematics 2022-08-24 Ross G. Pinsky

Optimal stopping problems give rise to random distributions describing how many applicants the decision-maker will sample or interview before choosing one, a quantity sometimes referred to as the search time or process duration. This…

Applications · Statistics 2019-12-13 Simon Demers

The Secretary problem is a classical sequential decision-making question that can be succinctly described as follows: a set of rank-ordered applicants are interviewed sequentially for a single position. Once an applicant is interviewed, an…

Combinatorics · Mathematics 2023-03-07 Xujun Liu , Olgica Milenkovic , George V. Moustakides

The classical Prophet Inequality arises from a fundamental problem in optimal-stopping theory. In this problem, a gambler sees a finite sequence of independent, non-negative random variables. If he stops the sequence at any time, he…

Optimization and Control · Mathematics 2019-01-10 Van-Anh Truong , Xinshang Wang

We explore a prophet inequality problem, where the values of a sequence of items are drawn i.i.d. from some distribution, and an online decision maker must select one item irrevocably. We establish that $\mathrm{CR}_{\ell}$ the worst-case…

Data Structures and Algorithms · Computer Science 2025-01-13 Mathieu Molina , Nicolas Gast , Patrick Loiseau , Vianney Perchet

In this work, we study the single-choice prophet inequality problem, where a gambler faces a sequence of~$n$ online i.i.d. random variables drawn from an unknown distribution. When a variable reveals its value, the gambler needs to decide…

Data Structures and Algorithms · Computer Science 2023-08-23 Bo Li , Xiaowei Wu , Yutong Wu

In the classic prophet inequality, samples from independent random variables arrive online. A gambler that knows the distributions must decide at each point in time whether to stop and pick the current sample or to continue and lose that…

Data Structures and Algorithms · Computer Science 2019-03-13 Jose Correa , Raimundo Saona , Bruno Ziliotto

We extend the standard online worst-case model to accommodate past experience which is available to the online player in many practical scenarios. We do this by revealing a random sample of the adversarial input to the online player ahead…

Data Structures and Algorithms · Computer Science 2019-07-12 Haim Kaplan , David Naori , Danny Raz

In this paper, we present a novel method for computing the asymptotic values of both the optimal threshold, and the probability of success in sequences of optimal stopping problems. This method, based on the resolution of a first-order…

Probability · Mathematics 2022-05-18 L. Bayón , P. Fortuny , J. M. Grau , A. M. Oller-Marcén , M. M. Ruiz

The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of work in generalizing these models to multiple items because of their applications in mechanism design. The most…

Data Structures and Algorithms · Computer Science 2018-03-20 Soheil Ehsani , MohammadTaghi Hajiaghayi , Thomas Kesselheim , Sahil Singla

We solve the secretary problem in the case that the ranked items arrive in a statistically biased order rather than in uniformly random order. The bias is given by the left-to-right-minimum exponentially tilted distribution with parameter…

Probability · Mathematics 2023-07-18 Ross G. Pinsky

Prophet inequalities are fundamental optimal stopping problems, where a decision-maker observes sequentially items with values sampled independently from known distributions, and must decide at each new observation to either stop and gain…

Data Structures and Algorithms · Computer Science 2024-11-19 Ziyad Benomar , Dorian Baudry , Vianney Perchet

We study a continuous and infinite time horizon counterpart to the classic prophet inequality, which we term the stationary prophet inequality problem. Here, copies of a good arrive and perish according to Poisson point processes. Buyers…

Data Structures and Algorithms · Computer Science 2021-07-23 Kristen Kessel , Amin Saberi , Ali Shameli , David Wajc

Prophet inequalities are a central object of study in optimal stopping theory. In the iid model, a gambler sees values in an online fashion, sampled independently from a given distribution. Upon observing each value, the gambler either…

Data Structures and Algorithms · Computer Science 2025-06-23 Giordano Giambartolomei , Frederik Mallmann-Trenn , Raimundo Saona

We study the prophet inequality, a fundamental problem in online decision-making and optimal stopping, in a practical setting where rewards are observed only through noisy realizations and reward distributions are unknown. At each stage,…

Machine Learning · Statistics 2026-04-03 Jung-hun Kim , Vianney Perchet