Countable-state average-cost regenerative stopping problems

1981 ◽  
Vol 18 (2) ◽  
pp. 361-377 ◽  
Author(s):  
Bruce L. Miller
Keyword(s):  
Finite Number ◽  
Optimal Stopping ◽  
Average Cost ◽  
Optimal Stopping Problem ◽  
Initial State ◽  
Countable State ◽  
State Average

Regenerative stopping problems are stopping problems which recommence from the initial state upon stopping. An algorithm is presented which solves semi-Markov regenerative stopping problem with a finite number of continue actions by solving a sequence of stopping problems. New results for the optimal stopping problem are obtained as well as for the regenerative stopping problem. A model in the literature is used as a detailed example of the algorithm.

Countable-state average-cost regenerative stopping problems

1981 ◽  
Vol 18 (02) ◽  
pp. 361-377 ◽  
Author(s):  
Bruce L. Miller
Keyword(s):  
Finite Number ◽  
Optimal Stopping ◽  
Average Cost ◽  
Optimal Stopping Problem ◽  
Initial State ◽  
Countable State ◽  
State Average

Regenerative stopping problems are stopping problems which recommence from the initial state upon stopping. An algorithm is presented which solves semi-Markov regenerative stopping problem with a finite number of continue actions by solving a sequence of stopping problems. New results for the optimal stopping problem are obtained as well as for the regenerative stopping problem. A model in the literature is used as a detailed example of the algorithm.

scholarly journals On a simple optimal stopping problem

1973 ◽  
Vol 5 (4) ◽  
pp. 297-312 ◽  
Author(s):  
William M. Boyce
Keyword(s):  
Optimal Stopping ◽  
Optimal Stopping Problem

A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping

2014 ◽  
Vol 51 (03) ◽  
pp. 885-889 ◽  
Author(s):  
Tomomi Matsui ◽  
Katsunori Ano
Keyword(s):  
Lower Bound ◽  
Optimal Stopping ◽  
Secretary Problem ◽  
Bernoulli Trials ◽  
Optimal Stopping Problem ◽  
Maximum Probability ◽  
Optimal Stopping Rule ◽  
Optimal Probability ◽  
Optimal Stopping Theory ◽  
Special Case

In this note we present a bound of the optimal maximum probability for the multiplicative odds theorem of optimal stopping theory. We deal with an optimal stopping problem that maximizes the probability of stopping on any of the last m successes of a sequence of independent Bernoulli trials of length N, where m and N are predetermined integers satisfying 1 ≤ m < N. This problem is an extension of Bruss' (2000) odds problem. In a previous work, Tamaki (2010) derived an optimal stopping rule. We present a lower bound of the optimal probability. Interestingly, our lower bound is attained using a variation of the well-known secretary problem, which is a special case of the odds problem.

The Optimal Stopping Problem

1969 ◽  
pp. 87-145
Author(s):  
Evgenii B. Dynkin ◽  
Aleksandr A. Yushkevich
Keyword(s):  
Optimal Stopping ◽  
Optimal Stopping Problem
Sign in / Sign up

Export Citation Format

Share Document