Finding the second-best candidate under the Mallows model
Authors:
- Xujun LiuXLXujun Liu
- Olgica MilenkovicOMOlgica Milenkovic
- 20 June 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 929, 39-68
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Defense Advanced Research Projects Agency
- National Science Foundation (CCF 15-26875)
This publication has 13 references indexed in Scilit:
- The Best-or-Worst and the Postdoc problems with random number of candidatesJournal of Combinatorial Optimization, 2018
- The Best-or-Worst and the Postdoc problemsJournal of Combinatorial Optimization, 2017
- Prophet SecretarySIAM Journal on Discrete Mathematics, 2017
- Online auctions and generalized secretary problemsACM SIGecom Exchanges, 2008
- A new secretary problem with rank-based selection and cardinal payoffsJournal of Mathematical Psychology, 2006
- A Problem of Optimal Choice and AssignmentOperations Research, 1982
- Dynamic Programming and Decision TheoryJournal of the Royal Statistical Society Series C: Applied Statistics, 1961
- Mathematical GamesScientific American, 1960
- Mathematical GamesScientific American, 1960
- Non-Null Ranking Models. IBiometrika, 1957