115 citations · 388 across the 61 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.PR2021
Running minimum in the best-choice problem
Alexander Gnedin, Patryk Kozieł, Małgorzata Sulkowska
We consider the best-choice problem for independent (not necessarily iid) observations with the aim of selecting the sample minimum. We show that in this full ge…
math.PR2021
Trapping the Ultimate Success
Alexander Gnedin, Zakaria Derbazi
We introduce a betting game, where the gambler aims to guess the last success epoch from past observed data. The player may bet on the event that no further successes occur, or cho…
math.PR2021★ 2 cited
How to beat the 1/e-strategy of best choice (the random arrivals problem)
Alexander Gnedin
In the best choice problem with random arrivals, an unknown number of rankable items arrive at times sampled from the uniform distribution. As is well known, a real-time player…