Why do these quite different best-choice problems have the same solutions?

DOI10.1239/aap/1086957578zbMath1071.60028OpenAlexW1984882568MaRDI QIDQ4819488

Stephen M. Samuels

Publication date: 24 September 2004

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1086957578

zbMATH Keywords

optimal stoppingsecretary problemplanar Poisson process

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Related Items (11)

Shelf life of candidates in the generalized secretary problem ⋮ Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon ⋮ Best choice from the planar Poisson process ⋮ Sum the Multiplicative Odds to One and Stop ⋮ Objectives in the Best-Choice Problems ⋮ Winning Rate in the Full-Information Best-Choice Problem ⋮ On the optimal stopping problems with monotone thresholds ⋮ Optimal stopping rule for the full-information duration problem with random horizon ⋮ Optimal Choice of the Best Available Applicant in Full-Information Models ⋮ An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object ⋮ Recognising the last record of sequence

Cites Work

• Unnamed Item
• 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
• Best choice from the planar Poisson process
• Choosing the best of the current crop
• The Best Choice Problem for a Random Number of Objects
• On the full information best-choice problem

This page was built for publication: Why do these quite different best-choice problems have the same solutions?