The hiring problem and permutations

MaRDI QIDQ3176556zbMATH OpenFDO

Authors Margaret Archibald, Conrado Martínez

Publication date 23 July 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0106

zbMATH Keywords

analytic combinatoricsgenerating functionshiring problemon-line decision makingpermutationssecretary problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Decision theory (91B06)

Recommendations

• Hiring above the m-th best candidate: a generalization of records in permutations
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem
• The hiring problem with rank-based strategies
• Remarks on the Secretary Problem

Cited in

(6)

• The hiring problem with rank-based strategies
• Hiring above the m-th best candidate: a generalization of records in permutations
• Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem

This page was built for publication: The hiring problem and permutations

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