Finding the second-best candidate under the Mallows model

DOI10.1016/J.TCS.2022.06.029MaRDI QIDQ2166728zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 25 August 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Mallows modelonline algorithmspermutationspostdoc problemsecond-best candidatesecretary problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The postdoc variant of the secretary problem
• The secretary problem with biased arrival order via a Mallows distribution
• The best-or-worst and the postdoc problems with random number of candidates
• Choosing either the best or the second best when the number of applicants is random
• The best-or-worst and the postdoc problems

Cites work

• A multiple-choice secretary algorithm with applications to online auctions
• A new secretary problem with rank-based selection and cardinal payoffs
• A Problem of Optimal Choice and Assignment
• A rank-based selection with cardinal payoffs and a cost of choice
• Avoiding patterns and making the best choice
• Beyond matroids: secretary problem and prophet inequality with general constraints
• Dynamic Programming and Decision Theory
• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• NON-NULL RANKING MODELS. I
• Opportunity costs in the game of best choice
• Positional strategies in games of best choice
• Prophet secretary
• Query-based selection of optimal candidates under the Mallows model
• The best-or-worst and the postdoc problems
• The best-or-worst and the postdoc problems with random number of candidates
• The postdoc variant of the secretary problem
• Weighted games of best choice

Cited in

(3)

• Query-based selection of optimal candidates under the Mallows model
• Finding the Second-Best Candidate under the Mallows Model
• Optimal stopping methodology for the secretary problem with random queries

This page was built for publication: Finding the second-best candidate under the Mallows model

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