The hiring problem with rank-based strategies

DOI10.1214/19-EJP382zbMATH Open1432.60020MaRDI QIDQ2279320FDOQ2279320

Authors Svante Janson 

Publication date 12 December 2019

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.03800

zbMATH Keywords

hiring problemhiring above medianmultiple secretary problem

Mathematics Subject Classification ID

Sequential statistical analysis (62L10) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial probability (60C05)

Abstract: The hiring problem is studied for general strategies based only on the relative ranking of the candidates; this includes some well known strategies studied before such as hiring above the median. We give general limit theorems for the number of hired candidates and some other properties, extending previous results. The results exhibit a dichotomy between two classes of rank-based strategies: either the asymptotics of the process are determined by the early events, with a.s. convergence of suitably normalized random variables, or there is a mixing behaviour without long-term memory and with asymptotic normality.

Recommendations

• The hiring problem and permutations
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• The hiring problem and Lake Wobegon strategies
• 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

Cites Work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 4000257 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• ANALYTIC METHODS FOR SELECT SETS
• Addendum to ``Moments of gamma type and the Brownian supremum process area
• 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
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Beat the Mean: Sequential Selection by Better Than Average Rules
• Extreme(ly) mean(ingful): sequential formation of a quality group
• Hiring above the \(m\)-th best candidate: a generalization of records in permutations
• NIST handbook of mathematical functions
• On mixing and stability of limit theorems
• Probability: a graduate course
• Select sets: rank and file
• Sequential selection with a better-than-average rule
• The hiring problem and Lake Wobegon strategies
• The hiring problem and permutations

Cited In (5)

• The hiring problem and permutations
• The hiring problem and Lake Wobegon strategies
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Strategic recruiting in ongoing hierarchies

Uses Software

• DLMF

This page was built for publication: The hiring problem with rank-based strategies

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