The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy

From MaRDI portal
Publication:2074989

DOI10.1016/j.spa.2021.12.008zbMath1480.60104OpenAlexW4200292535MaRDI QIDQ2074989

Alexander V. Gnedin

Publication date: 11 February 2022

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spa.2021.12.008






Cites Work


This page was built for publication: The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy