Why do these quite different best-choice problems have the same solutions?
From MaRDI portal
(Redirected from Publication:4819488)
Recommendations
Cites work
- scientific article; zbMATH DE number 67283 (Why is no real title available?)
- Best choice from the planar Poisson process
- Choosing the best of the current crop
- On a best choice problem with partial information
- On best choice problems having similar solutions
- On the full information best-choice problem
- The Best Choice Problem for a Random Number of Objects
- The full-information best choice problem with a random number of observations
Cited in
(13)- Best choice from the planar Poisson process
- Optimal choice of the best available applicant in full-information models
- Optimal stopping rule for the no-information duration problem with random horizon
- Shelf life of candidates in the generalized secretary problem
- Sum the multiplicative odds to one and stop
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
- Objectives in the Best-Choice Problems
- Recognising the last record of sequence
- On best choice problems having similar solutions
- On the optimal stopping problems with monotone thresholds
- Optimal stopping rule for the full-information duration problem with random horizon
- Urn sampling distributions giving alternate correspondences between two optimal stopping problems
- Winning Rate in the Full-Information Best-Choice Problem
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)
