Sum the Multiplicative Odds to One and Stop
From MaRDI portal
Publication:4933198
DOI10.1239/jap/1285335408zbMath1201.60039OpenAlexW2065322026MaRDI QIDQ4933198
Publication date: 12 October 2010
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1285335408
optimal stoppingnonhomogeneous Poisson processsecretary problemplanar Poisson processone-stage look-ahead rulemonotone problemodds theorem
Related Items (10)
Maximizing the probability of stopping on any of the last m successes in independent Bernoulli trials with random horizon ⋮ Harmonic numbers in gambler's ruin problem ⋮ Stochastic processes with proportional increments and the last-arrival problem ⋮ Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera ⋮ Odds -theorem and monotonicity ⋮ Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon ⋮ Compare the ratio of symmetric polynomials of odds to one and stop ⋮ On the optimal stopping problems with monotone thresholds ⋮ Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings ⋮ Weber's optimal stopping problem and generalizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an optimal stopping problem of Gusein-Zade
- Who solved the secretary problem
- A note on bounds for the odds theorem of optimal stopping.
- Sum the odds to one and stop
- Best choice from the planar Poisson process
- Optimal selection based on relative rank (the 'Secretary Problem')
- On a class of secretary problems
- Two Notes on Notation
- Selecting the last success in Markov-dependent trials
- Optimal Choice of the Best Available Applicant in Full-Information Models
- The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations
- A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank
- The odds algorithm based on sequential updating and its performance
- The Best Choice Problem for a Random Number of Objects
- Selecting a sequence of last successes in independent trials
- On the full information best-choice problem
- Why do these quite different best-choice problems have the same solutions?
- Dynamic Programming and Decision Theory
This page was built for publication: Sum the Multiplicative Odds to One and Stop
