Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings
From MaRDI portal
Publication:2806827
DOI10.1287/moor.2015.0748zbMath1338.60119arXiv1204.5537OpenAlexW3104095460MaRDI QIDQ2806827
Publication date: 19 May 2016
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.5537
Related Items (7)
Prophet inequality with competing agents ⋮ A unified approach for solving sequential selection problems ⋮ Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera ⋮ Odds -theorem and monotonicity ⋮ Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search ⋮ Generalization on optimal multiple stopping with application to swing options with random exercise rights number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invariant record processes and applications to best choice modelling
- Sharp inequalities for optimal stopping with rewards based on ranks
- Who solved the secretary problem
- A note on bounds for the odds theorem of optimal stopping.
- Secretary problems as a source of benchmark bounds
- Sum the odds to one and stop
- Simple ratio prophet inequalities for a mortal with multiple choices
- Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings
- Odds Theorem with Multiple Selection Chances
- Selecting the last success in Markov-dependent trials
- Extremal processes, secretary problems and the 1/e law
- The odds algorithm based on sequential updating and its performance
- Selecting a sequence of last successes in independent trials
- Sum the Multiplicative Odds to One and Stop
This page was built for publication: Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings
