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

DOI10.1007/S00453-014-9895-3MaRDI QIDQ486994zbMATHOpenAlexDBLPWikidataFDO

Authors Ahmed Helmi, Conrado Martínez, Alois Panholzer

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

Chinese restaurant processperturbationsecretary problemrecordshiring problemon-line decision problems

Mathematics Subject Classification ID

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

Recommendations

• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Hiring above the \(m\)-th best candidate: a generalization of records in permutations
• The hiring problem with rank-based strategies
• Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem
• Optimal choice of the best available applicant in full-information models
• scientific article; zbMATH DE number 3993292
• The best-or-worst and the postdoc problems with random number of candidates
• Strategic recruiting in ongoing hierarchies
• The hiring problem and permutations

Cites work

• scientific article; zbMATH DE number 5764867 (Why is no real title available?)
• scientific article; zbMATH DE number 3947461 (Why is no real title available?)
• scientific article; zbMATH DE number 3690380 (Why is no real title available?)
• scientific article; zbMATH DE number 1212031 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• A Note on the Theory of Moment Generating Functions
• A multiple-choice secretary algorithm with applications to online auctions
• A note on Stirling series
• A note on multiple stopping rules
• Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Analytic combinatorics
• Beat the Mean: Sequential Selection by Better Than Average Rules
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Data streams as random permutations: the distinct element problem
• Estimating the unknown sample size
• Extreme(ly) mean(ingful): sequential formation of a quality group
• Hiring above the \(m\)-th best candidate: a generalization of records in permutations
• Improved algorithms and analysis for secretary problems and generalizations
• On Multiple Choice Secretary Problems
• Select sets: rank and file
• Sequential selection with a better-than-average rule
• Submodular secretary problem and extensions
• The Secretary Problem and Its Extensions: A Review
• The hiring problem and permutations
• \(d\)-records in geometrically distributed random variables

Cited in

(7)

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

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

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