Translator Disclaimer
2019 The hiring problem with rank-based strategies
Svante Janson
Electron. J. Probab. 24: 1-35 (2019). DOI: 10.1214/19-EJP382

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.

Citation

Download Citation

Svante Janson. "The hiring problem with rank-based strategies." Electron. J. Probab. 24 1 - 35, 2019. https://doi.org/10.1214/19-EJP382

Information

Received: 11 September 2018; Accepted: 27 October 2019; Published: 2019
First available in Project Euclid: 9 November 2019

zbMATH: 07142919
MathSciNet: MR4029428
Digital Object Identifier: 10.1214/19-EJP382

Subjects:
Primary: 60C05, 68W40
Secondary: 62L10, 68W27

JOURNAL ARTICLE
35 PAGES


SHARE
Vol.24 • 2019
Back to Top