Hiring above the m-th best candidate: a generalization of records in permutations

DOI10.1007/978-3-642-29344-3_40zbMATH Open1354.91039DBLPconf/latin/HelmiMP12OpenAlexW122033364WikidataQ61734785 ScholiaQ61734785MaRDI QIDQ2894489FDOQ2894489

Authors: Ahmed Helmi, Conrado Martínez, Alois Panholzer 

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_40

Recommendations

• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• The hiring problem and permutations
• Remarks on the Secretary Problem
• 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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Decision theory (91B06) Probabilistic games; gambling (91A60)

Cited In (6)

• The hiring problem with rank-based strategies
• The hiring problem and permutations
• Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem
• 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

This page was built for publication: Hiring above the \(m\)-th best candidate: a generalization of records in permutations

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