English
Related papers

Related papers: Polymatroid Prophet Inequalities

200 papers

We investigate the role of commitment in optimal stopping by studying all the variants between Prophet Inequality (PI) and Pandora's Box (PB). Both problems deal with a set of variables drawn from known distributions. In PI the gambler…

Data Structures and Algorithms · Computer Science 2025-09-30 José Correa , Evangelia Gergatsouli , Bruno Ziliotto

Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence…

Logic · Mathematics 2021-12-09 Laurent Bienvenu , Valentino Delle Rose , Tomasz Steifer

In this article, I will present a paradox whose purpose is to draw your attention to an important topic in finance, concerning the non-independence of the financial returns (non-ergodic hypothesis). In this paradox, we have two people…

General Finance · Quantitative Finance 2019-05-17 Andrea Berdondini

Due to numerous applications in retail and (online) advertising the problem of assortment selection has been widely studied under many combinations of discrete choice models and feasibility constraints. In many situations, however, an…

Data Structures and Algorithms · Computer Science 2023-08-11 Vineet Goyal , Salal Humair , Orestis Papadigenopoulos , Assaf Zeevi

This note records a common threshold/surplus decomposition for single-threshold stopping rules in the classical prophet inequality. The same decomposition is used to certify several deterministic thresholds, including the median, half-mean,…

Probability · Mathematics 2026-05-28 Jiechen Zhang

Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other words, there are outcome sequences x where an effectively…

Logic · Mathematics 2022-01-19 George Barmpalias , Lu Liu

We consider a game in which a blindfolded player attempts to set $n$ counters lying on the vertices of a rotating regular $n$-gon table simultaneously to $0$. When the counters count$\pmod{m}$ we simplify the argument of Bar Yehuda, Etzion,…

Combinatorics · Mathematics 2024-03-01 Samuel Korsky

In this article, we look at a hat-guessing game, in which each player must guess the color of their own hat while only seeing the hats of the other players. We focus on the case of two hat colors and a countably infinite number of players.…

Probability · Mathematics 2025-10-28 Nathaniel Eldredge

Suppose a gambler starts with a fortune in (0,1) and wishes to attain a fortune of 1 by making a sequence of bets. Assume thay whenever the gambler stakes the amount s, the gambler's fortune increases by s with probability w and decreases…

Probability · Mathematics 2007-05-23 Jason Schweinsberg

Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a product sold by a large online retailer. Given distributional information about what price they might face each day, how should they choose when to…

Data Structures and Algorithms · Computer Science 2019-10-10 Hossein Esfandiari , MohammadTaghi HajiAghayi , Brendan Lucier , Michael Mitzenmacher

The Prophet Inequality and Pandora's Box problems are fundamental stochastic problem with applications in Mechanism Design, Online Algorithms, Stochastic Optimization, Optimal Stopping, and Operations Research. A usual assumption in these…

Data Structures and Algorithms · Computer Science 2023-12-08 Khashayar Gatmiry , Thomas Kesselheim , Sahil Singla , Yifan Wang

This work introduces \emph{sharding} and \emph{Poissonization} as a unified framework for analyzing prophet inequalities. Sharding involves splitting a random variable into several independent random variables, shards, that collectively…

Data Structures and Algorithms · Computer Science 2024-04-05 Elfarouk Harb

Optimal stopping theory is a powerful tool for analyzing scenarios such as online auctions in which we generally require optimizing an objective function over the space of stopping rules for an allocation process under uncertainty. Perhaps…

Computer Science and Game Theory · Computer Science 2015-10-16 Hossein Esfandiari , MohammadTaghi Hajiaghayi , Vahid Liaghat , Morteza Monemizadeh

In the prophet secretary problem, $n$ values are drawn independently from known distributions, and presented in a uniformly random order. A decision-maker must accept or reject each value when it is presented, and may accept at most $k$…

Computer Science and Game Theory · Computer Science 2022-06-09 Nick Arnosti , Will Ma

We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…

Probability · Mathematics 2024-09-05 Natalia Cardona-Tobón , Anja Sturm , Jan M. Swart

We consider Bayesian online selection problem of a matching in bipartite graphs, i.e., online weighted matching problem with edge arrivals where online algorithm knows distributions of weights, that corresponds to the intersection of two…

Computer Science and Game Theory · Computer Science 2019-02-19 Nick Gravin , Hongao Wang

Prophet inequalities are performance guarantees for online algorithms (a.k.a. stopping rules) solving the following "hiring problem": a decision maker sequentially inspects candidates whose values are independent random numbers and is asked…

Data Structures and Algorithms · Computer Science 2022-05-23 Makis Arsenis , Robert Kleinberg

Football forecasting models traditionally rate teams on past match results, that is based on the number of goals scored. Goals, however, involve a high element of chance and thus past results often do not reflect the performances of the…

Applications · Statistics 2021-01-07 Edward Wheatcroft , Ewelina Sienkiewicz

The study of the prophet inequality problem in the limited information regime was initiated by Azar et al. [SODA'14] in the pursuit of prior-independent posted-price mechanisms. As they show, $O(1)$-competitive policies are achievable using…

Computer Science and Game Theory · Computer Science 2021-11-24 Constantine Caramanis , Matthew Faw , Orestis Papadigenopoulos , Emmanouil Pountourakis

The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…

Logic · Mathematics 2015-04-16 Ron Peretz
‹ Prev 1 3 4 5 6 7 10 Next ›