Choosing either the best or the second best when the number of applicants is random

DOI10.1016/S0898-1221(03)90120-9zbMath1052.60007OpenAlexW2008619552MaRDI QIDQ597360

Sumit K. Garg

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

zbMATH Keywords

dynamic programmingoptimal stoppingrelative ranksbest-choice secretary problemunknown number of applicants

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40) Sequential statistical analysis (62L10) Optimal stopping in statistics (62L15)

Related Items (3)

A unified approach for solving sequential selection problems ⋮ Shelf life of candidates in the generalized secretary problem ⋮ On a duration problem with unbounded geometrical horizon

Cites Work

• On an optimal stopping problem of Gusein-Zade
• The best-choice secretary problem with random freeze on jobs
• On the best choice problem with random population size
• The Best Choice Problem for a Random Number of Objects
• On the best-choice problem when the number of observations is random

This page was built for publication: Choosing either the best or the second best when the number of applicants is random