The Secretary Problem with Reservation Costs
- 20 October 2021
- book chapter
- Published by Springer Nature
- p. 553-564
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the advice complexity of the online -coloring problem on paths and cyclesTheoretical Computer Science, 2014
- The string guessing problem as a method to prove lower bounds on the advice complexityTheoretical Computer Science, 2014
- The online knapsack problem: Advice and randomizationTheoretical Computer Science, 2014
- Secretary Problems via Linear ProgrammingMathematics of Operations Research, 2014
- On the Power of Randomness versus Advice in Online Computation2012
- On the Advice Complexity of the k-Server Problem2011
- Online auctions and generalized secretary problemsACM SIGecom Exchanges, 2008
- A Knapsack Secretary Problem with Applications2007
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Dynamic Programming and Decision TheoryJournal of the Royal Statistical Society Series C: Applied Statistics, 1961