The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations

DOI10.1239/aap/1261669585zbMath1186.62101OpenAlexW2001426965MaRDI QIDQ3558937

Abba M. Krieger, Ester Samuel-Cahn

Publication date: 11 May 2010

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1261669585

zbMATH Keywords

secretary problemrelative ranksuboptimal ruleabsolute rankgroup selection rulesnear optimal rule

Mathematics Subject Classification ID

Sequential statistical methods (62L99) Strong limit theorems (60F15) Statistical ranking and selection procedures (62F07) Optimal stopping in statistics (62L15)

Related Items (4)

A unified approach for solving sequential selection problems ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ Sum the Multiplicative Odds to One and Stop ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search

Cites Work

• Select sets: rank and file
• Optimal selection based on relative rank (the 'Secretary Problem')
• SELECTING SATISFACTORY SECRETARIES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations