The hiring problem with rank-based strategies

DOI10.1214/19-EJP382zbMath1432.60020arXiv1809.03800MaRDI QIDQ2279320

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

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

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Addendum to ``Moments of gamma type and the Brownian supremum process area
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Extreme(ly) mean(ingful): sequential formation of a quality group
• On mixing and stability of limit theorems
• Sequential selection with a better-than-average rule
• Select sets: rank and file
• Hiring above the m-th Best Candidate: A Generalization of Records in Permutations
• The Hiring Problem and Lake Wobegon Strategies
• ANALYTIC METHODS FOR SELECT SETS
• Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem
• Beat the Mean: Sequential Selection by Better Than Average Rules
• Probability: A Graduate Course

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