The hiring problem with rank-based strategies

From MaRDI portal
Publication:2279320

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


Authors: Svante Janson Edit this on Wikidata


Publication date: 12 December 2019

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

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.


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




Recommendations




Cites Work


Cited In (2)

Uses Software





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)