English
Related papers

Related papers: Prophet Inequalities Require Only a Constant Numbe…

200 papers

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

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 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

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

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

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

In modern sample-driven Prophet Inequality, an adversary chooses a sequence of $n$ items with values $v_1, v_2, \ldots, v_n$ to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase),…

Optimization and Control · Mathematics 2022-09-30 Krishnendu Chatterjee , Mona Mohammadi , Raimundo Saona

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 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

We study the single-choice Prophet Inequality problem when the gambler is given access to samples. We show that the optimal competitive ratio of $1/2$ can be achieved with a single sample from each distribution. When the distributions are…

Data Structures and Algorithms · Computer Science 2025-09-12 Aviad Rubinstein , Jack Z. Wang , S. Matthew Weinberg

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

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

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

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

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

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

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

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 introduce the \textit{prophet inequality with uncertain acceptance} model, in which a decision maker sequentially observes a sequence of independent options, each characterized by a value $x_i$ and an acceptance probability $p_i$, both…

Computer Science and Game Theory · Computer Science 2026-03-25 Emile Martinez , Felipe Garrido-Lucero , Umberto Grandi , Sebastian Pérez-Salazar
‹ Prev 1 2 3 10 Next ›