No-information secretary problems with cardinal payoffs and Poisson arrivals
From MaRDI portal
Publication:844877
DOI10.1016/j.spl.2009.10.010zbMath1180.62114OpenAlexW2086274793MaRDI QIDQ844877
Elżbieta Z. Ferenstein, Anna Krasnosielska-Kobos
Publication date: 5 February 2010
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2009.10.010
Inference from stochastic processes (62M99) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to a class of best choice problems with an unknown number of options
- A version of the Elfving problem with random starting time
- The full-information best choice problem with a random number of observations
- On optimal stopping of a sequence of independent random variables- probability maximizing approach
- Who solved the secretary problem
- Analysis of heuristic solutions to the best choice problem.
- A note on bounds for the odds theorem of optimal stopping.
- Sum the odds to one and stop
- A new secretary problem with rank-based selection and cardinal payoffs
- Optimal Stopping With Random Horizon With Application to the Full-Information Best-Choice Problem With Random Freeze
- A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank
- A rank-based selection with cardinal payoffs and a cost of choice
- On an optimal selection problem of Cowan and Zabczyk
- The Secretary Problem with an Unknown Number of Options
- The Best Choice Problem for a Random Number of Objects
- Optimal stopping of a risk process
- Optimal Stopping for I.I.D. Random Variables Based on the Sequential Information of the Location of Relative Records Only
- A persistency problem connected with a point process
This page was built for publication: No-information secretary problems with cardinal payoffs and Poisson arrivals
