Finding the second-best candidate under the Mallows model

DOI10.1016/J.TCS.2022.06.029OpenAlexW3098093980MaRDI QIDQ2166728

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

permutationsonline algorithmssecretary problemMallows modelpostdoc problemsecond-best candidate

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Query-based selection of optimal candidates under the Mallows model

Cites Work

• Unnamed Item
• Unnamed Item
• Opportunity costs in the game of best choice
• The best-or-worst and the postdoc problems
• Avoiding patterns and making the best choice
• Positional strategies in games of best choice
• The best-or-worst and the postdoc problems with random number of candidates
• A new secretary problem with rank-based selection and cardinal payoffs
• NON-NULL RANKING MODELS. I
• A rank-based selection with cardinal payoffs and a cost of choice
• A Problem of Optimal Choice and Assignment
• The postdoc variant of the secretary problem
• Weighted Games of Best Choice
• Prophet Secretary
• Beyond matroids: secretary problem and prophet inequality with general constraints
• Dynamic Programming and Decision Theory
• Query-based selection of optimal candidates under the Mallows model

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