The hiring problem and Lake Wobegon strategies

DOI10.1137/07070629XMaRDI QIDQ3586178zbMATHWikidataFDO

Authors Andrei Broder, Adam Kirsch, Ravi Kumar, Eli Upfal, Sergei Vassilvitskii, Michael Mitzenmacher

Publication date 6 September 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

secretary problemlognormal distributionsmartingale analysisLake Wobegon strategies

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Recommendations

• Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem
• The hiring problem with rank-based strategies
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Hiring above the \(m\)-th best candidate: a generalization of records in permutations

Cited in

(5)

• Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
• The hiring problem with rank-based strategies
• A topological data analysis based classifier
• Strategic recruiting in ongoing hierarchies
• Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem

This page was built for publication: The hiring problem and Lake Wobegon strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586178)