Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T21:56:09.596Z Has data issue: false hasContentIssue false

Optimality of the one step look-ahead stopping times

Published online by Cambridge University Press:  14 July 2016

M. Abdel-Hameed*
Affiliation:
University of North Carolina at Charlotte

Abstract

The optimality of the one step look-ahead stopping rule is shown to hold under conditions different from those discussed by Chow, Robbins and Seigmund [5]. These results are corollaries of the following theorem: Let {Xn , n = 0, 1, …}; X 0 = x be a discrete-time homogeneous Markov process with state space (E, ℬ). For any ℬ-measurable function g and α in (0, 1], define Aαg(x) = αExg(X 1) – g(x) to be the infinitesimal generator of g. If τ is any stopping time satisfying the conditions: Ex [αNg(XN )I(τ > N)]→0 as as N → ∞, then Applications of the results are considered.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1977 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable