Improved algorithms and analysis for secretary problems and generalizations
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 473-482
- https://doi.org/10.1109/sfcs.1995.492578
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On Multiple Choice Secretary ProblemsMathematics of Operations Research, 1994
- Who Solved the Secretary Problem?Statistical Science, 1989
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- The Secretary Problem and Its Extensions: A ReviewInternational Statistical Review, 1983
- The d choice secretary problemCommunications in Statistics. Part C: Sequential Analysis, 1983
- The Optimal Choice of a Subset of a PopulationMathematics of Operations Research, 1980
- The Finite-Memory Secretary ProblemThe Annals of Probability, 1977
- Recognizing the Maximum of a SequenceJournal of the American Statistical Association, 1966
- Optimal selection based on relative rank (the “secretary problem”)Israel Journal of Mathematics, 1964
- Dynamic Programming and Decision TheoryJournal of the Royal Statistical Society Series C: Applied Statistics, 1961