The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations
From MaRDI portal
Publication:3558937
DOI10.1239/aap/1261669585zbMath1186.62101MaRDI QIDQ3558937
Abba M. Krieger, Ester Samuel-Cahn
Publication date: 11 May 2010
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1261669585
secretary problem; relative rank; suboptimal rule; absolute rank; group selection rules; near optimal rule
62L99: Sequential statistical methods
60F15: Strong limit theorems
62F07: Statistical ranking and selection procedures
62L15: Optimal stopping in statistics
Related Items
Sum the Multiplicative Odds to One and Stop, Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem, Progressive stopping heuristics that excel in individual and competitive sequential search, A unified approach for solving sequential selection problems
Cites Work