Choosing either the best or the second best when the number of applicants is random
From MaRDI portal
Publication:597360
DOI10.1016/S0898-1221(03)90120-9zbMath1052.60007MaRDI QIDQ597360
Publication date: 6 August 2004
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(03)90120-9
dynamic programming; optimal stopping; relative ranks; best-choice secretary problem; unknown number of applicants
60C05: Combinatorial probability
60G40: Stopping times; optimal stopping problems; gambling theory
62L10: Sequential statistical analysis
62L15: Optimal stopping in statistics
Related Items
Shelf life of candidates in the generalized secretary problem, On a duration problem with unbounded geometrical horizon, A unified approach for solving sequential selection problems
Cites Work