2 papers
math.PR2026
Optimal Stopping for the Uniform Distribution
Alexander Gnedin
Many discrete-time optimal stopping problems are known to have more tractable limit forms based on a planar Poisson process. Using this tool we find a solution to the optimal stopp…
math.PR2025
Maximal Counts in the Stopped Occupancy Problem
Alexander Gnedin, Svante Janson, Yaakov Malinovsky
We revisit a version of the classic occupancy scheme, where balls are thrown until almost all boxes receive a given number of balls. Special cases are widely known as coupon-collec…