English
Related papers

Related papers: IID Prophet Inequality with Random Horizon: Going …

200 papers

Prophet inequalities are a central object of study in optimal stopping theory. A gambler is sent values in an online fashion, sampled from an instance of independent distributions, in an adversarial, random or selected order, depending on…

Data Structures and Algorithms · Computer Science 2024-11-05 Giordano Giambartolomei , Frederik Mallmann-Trenn , Raimundo Saona

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

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 a prophet inequality problem, $n$ independent random variables are presented to a gambler one by one. The gambler decides when to stop the sequence and obtains the most recent value as reward. We evaluate a stopping rule by the…

Data Structures and Algorithms · Computer Science 2023-11-16 Andrés Cristi , Bruno Ziliotto

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

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 realized and the gambler either accepts it and the game…

Data Structures and Algorithms · Computer Science 2022-04-05 Bo Peng , Zhihao Gavin Tang

In the classical prophet inequality, a gambler observes a sequence of stochastic rewards $V_1,...,V_n$ and must decide, for each reward $V_i$, whether to keep it and stop the game or to forfeit the reward forever and reveal the next value…

Data Structures and Algorithms · Computer Science 2013-07-16 Pablo D. Azar , Robert Kleinberg , S. Matthew Weinberg

Free order prophet inequalities bound the ratio between the expected value obtained by two parties each selecting a value from a set of independent random variables: a "prophet" who knows the value of each variable and may select the…

Data Structures and Algorithms · Computer Science 2020-10-20 Makis Arsenis , Odysseas Drosis , Robert Kleinberg

Consider a gambler who observes a sequence of independent, non-negative random numbers and is allowed to stop the sequence at any time, claiming a reward equal to the most recent observation. The famous prophet inequality of Krengel,…

Data Structures and Algorithms · Computer Science 2012-01-24 Robert Kleinberg , S. Matthew Weinberg

The setting of the classic prophet inequality is as follows: a gambler is shown the probability distributions of $n$ independent, non-negative random variables with finite expectations. In their indexed order, a value is drawn from each…

Data Structures and Algorithms · Computer Science 2018-12-31 Jack Wang

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

Prophet inequality concerns a basic optimal stopping problem and states that simple threshold stopping policies -- i.e., accepting the first reward larger than a certain threshold -- can achieve tight $\frac{1}{2}$-approximation to the…

Computer Science and Game Theory · Computer Science 2024-10-31 Wei Tang , Haifeng Xu , Ruimin Zhang , Derek Zhu

In this paper, we introduce an over-time variant of the well-known prophet inequality with i.i.d. random variables. Instead of stopping with one realized value at some point in the process, we decide for each step how long we select the…

Data Structures and Algorithms · Computer Science 2025-09-08 Andreas Abels , Elias Pitschmann , Daniel Schmand

We introduce a variant of the classic prophet inequality, called \emph{residual prophet inequality} (RPI). In the RPI problem, we consider a finite sequence of $n$ nonnegative independent random values with known distributions, and a known…

Data Structures and Algorithms · Computer Science 2025-07-24 Jose Correa , Sebastian Perez-Salazar , Dana Pizarro , Bruno Ziliotto

A prophet inequality states, for some $\alpha\in[0,1]$, that the expected value achievable by a gambler who sequentially observes random variables $X_1,\dots,X_n$ and selects one of them is at least an $\alpha$ fraction of the maximum value…

Data Structures and Algorithms · Computer Science 2020-11-24 José Correa , Paul Dütting , Felix Fischer , Kevin Schewior , Bruno Ziliotto

Prophet inequalities for rewards maximization are fundamental to optimal stopping theory with extensive applications to mechanism design and online optimization. We study the \emph{cost minimization} counterpart of the classical prophet…

Computer Science and Game Theory · Computer Science 2023-02-24 Vasilis Livanos , Ruta Mehta

We study threshold testing, an elementary probing model with the goal to choose a large value out of $n$ i.i.d. random variables. An algorithm can test each variable $X_i$ once for some threshold $t_i$, and the test returns binary feedback…

Data Structures and Algorithms · Computer Science 2024-06-13 Martin Hoefer , Kevin Schewior

A central object in optimal stopping theory is the single-choice prophet inequality for independent, identically distributed random variables: Given a sequence of random variables $X_1,\dots,X_n$ drawn independently from a distribution $F$,…

Data Structures and Algorithms · Computer Science 2021-04-08 José R. Correa , Paul Dütting , Felix Fischer , Kevin Schewior

We consider the problem of selling perishable items to a stream of buyers in order to maximize social welfare. A seller starts with a set of identical items, and each arriving buyer wants any one item, and has a valuation drawn i.i.d. from…

Computer Science and Game Theory · Computer Science 2020-01-23 Reza Alijani , Siddhartha Banerjee , Sreenivas Gollapudi , Kamesh Munagala , Kangning Wang

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 choose whether to accept its value as her reward and quit…

Data Structures and Algorithms · Computer Science 2023-05-23 Archit Bubna , Ashish Chiplunkar
‹ Prev 1 2 3 10 Next ›