Query-based selection of optimal candidates under the Mallows model

DOI10.1016/j.tcs.2023.114206arXiv2101.07250OpenAlexW3124128210MaRDI QIDQ6057847

Olgica Milenković, George V. Moustakides, Xujun Liu

Publication date: 26 October 2023

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

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

zbMATH Keywords

permutationssecretary problemMallows modeldowry problembest candidatequery-based

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Finding the second-best candidate under the Mallows model ⋮ Query-based selection of optimal candidates under the Mallows model

Cites Work

• Unnamed Item
• Unnamed Item
• Partially ordered secretaries
• Who solved the secretary problem
• Opportunity costs in the game of best choice
• The best-choice problem for partially ordered objects.
• Avoiding patterns and making the best choice
• Finding the second-best candidate under the Mallows model
• Positional strategies in games of best choice
• The secretary problem on an unknown poset
• NON-NULL RANKING MODELS. I
• On a universal best choice algorithm for partially ordered sets
• The Secretary Problem and Its Extensions: A Review
• A Problem of Optimal Choice and Assignment
• The postdoc variant of the secretary problem
• Weighted Games of Best Choice
• Dynamic Programming and Decision Theory
• Query-based selection of optimal candidates under the Mallows model

This page was built for publication: Query-based selection of optimal candidates under the Mallows model