Analysis of the strategy ``hiring above the \(m\)-th best candidate

DOI10.1007/s00453-014-9895-3zbMath1307.91059OpenAlexW2023100146WikidataQ61734775 ScholiaQ61734775MaRDI QIDQ486994

Alois Panholzer, Conrado Martínez, Ahmed Helmi

Publication date: 19 January 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9895-3

zbMATH Keywords

perturbationrecordssecretary problemChinese restaurant processhiring problemon-line decision problems

Mathematics Subject Classification ID

Decision theory (91B06) Operations research and management science (90B99) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (1)

The hiring problem with rank-based strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Extreme(ly) mean(ingful): sequential formation of a quality group
• Sequential selection with a better-than-average rule
• Estimating the unknown sample size
• Select sets: rank and file
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Improved Algorithms and Analysis for Secretary Problems and Generalizations
• Hiring above the m-th Best Candidate: A Generalization of Records in Permutations
• Submodular Secretary Problem and Extensions
• The Secretary Problem and Its Extensions: A Review
• On Multiple Choice Secretary Problems
• A note on multiple stopping rules
• A Note on Stirling Series
• Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem
• Beat the Mean: Sequential Selection by Better Than Average Rules
• A Note on the Theory of Moment Generating Functions

This page was built for publication: Analysis of the strategy ``hiring above the \(m\)-th best candidate