Recognising the last record of sequence
From MaRDI portal
Publication:3429340
DOI10.1080/17442500600893027zbMath1156.60025arXivmath/0602278OpenAlexW2069743761MaRDI QIDQ3429340
Publication date: 30 March 2007
Published in: Stochastics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602278
Related Items (4)
Random recurrence equations and ruin in a Markov-dependent stochastic economic environment ⋮ Running minimum in the best-choice problem ⋮ Robust best choice problem ⋮ Winning Rate in the Full-Information Best-Choice Problem
Cites Work
- Unnamed Item
- A unified approach to a class of best choice problems with an unknown number of options
- Records in a partially ordered set
- Regenerative composition structures
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length
- Sum the odds to one and stop
- Counting intervals in the packing process
- Approximation of optimal stopping problems.
- Exchangeable and partially exchangeable random partitions
- Best choice from the planar Poisson process
- Box-Spaces and Random Partial Orders
- Extremal processes, secretary problems and the 1/e law
- Universal Limit Laws for Depths in Random Trees
- On the full information best-choice problem
- Why do these quite different best-choice problems have the same solutions?
- Random Fragmentation and Coagulation Processes
This page was built for publication: Recognising the last record of sequence
