Minimax-optimal stop rules and distributions in secretary problems
From MaRDI portal
Publication:756847
DOI10.1214/AOP/1176990548zbMATH Open0723.60043OpenAlexW2018546894MaRDI QIDQ756847FDOQ756847
Authors: Theodore P. Hill, Ulrich Krengel 
Publication date: 1991
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176990548
Recommendations
- A unified approach to a class of best choice problems with an unknown number of options
- The secretary problem: minimizing the expected rank with I.I.D. random variables
- The best choice problem with an unknown number of objects
- Extremal processes, secretary problems and the 1/e law
- scientific article; zbMATH DE number 1232442
Cited In (14)
- Optimal Stopping Problem with Controlled Recall
- Probability maximizing approach to a secretary problem by random change-point of the distribution law of the observed process
- Minimizing the expected rank with full information
- Minimax stopping times for I.I.D. Random variables
- Two measures of efficiency for the secretary problem with multiple items at each rank
- Minimax strategies for discounted ?secretary problems? with interview costs
- The best-choice secretary problem with random freeze on jobs
- Title not available (Why is that?)
- The secretary problem with distributions
- An application of prophet regions to optimal stopping with a random number of observations
- Games of stopping with infinite horizon
- On the game of googol
- Moment-based minimax stopping functions for sequences of random variables
- The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy
This page was built for publication: Minimax-optimal stop rules and distributions in secretary problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756847)
