Why do these quite different best-choice problems have the same solutions?
From MaRDI portal
Publication:4819488
DOI10.1239/AAP/1086957578zbMATH Open1071.60028OpenAlexW1984882568MaRDI QIDQ4819488FDOQ4819488
Authors: Stephen M. Samuels 
Publication date: 24 September 2004
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1086957578
Recommendations
Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)
Cites Work
- The Best Choice Problem for a Random Number of Objects
- Best choice from the planar Poisson process
- On the full information best-choice problem
- The full-information best choice problem with a random number of observations
- On a best choice problem with partial information
- On best choice problems having similar solutions
- Title not available (Why is that?)
- Choosing the best of the current crop
Cited In (13)
- Winning Rate in the Full-Information Best-Choice Problem
- On the optimal stopping problems with monotone thresholds
- On best choice problems having similar solutions
- Urn sampling distributions giving alternate correspondences between two optimal stopping problems
- Objectives in the Best-Choice Problems
- Optimal stopping rule for the full-information duration problem with random horizon
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
- Recognising the last record of sequence
- Sum the multiplicative odds to one and stop
- Shelf life of candidates in the generalized secretary problem
- Best choice from the planar Poisson process
- Optimal stopping rule for the no-information duration problem with random horizon
- Optimal choice of the best available applicant in full-information models
This page was built for publication: Why do these quite different best-choice problems have the same solutions?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819488)
