
Let (S n ) n≥0 be a correlated random walk on the integers, let M 0 ≥ S 0 be an arbitrary integer, and let M n = max{M 0, S 1,…, S n }. An optimal stopping rule is derived for the sequence M n - nc, where c > 0 is a fixed cost. The optimal rule is shown to be of threshold type: stop at the first time that M n - S n ≥ Δ, where Δ is a certain nonnegative integer. An explicit expression for this optimal threshold is given.
Stopping times; optimal stopping problems; gambling theory, Sums of independent random variables; random walks, Optimal stopping in statistics
Stopping times; optimal stopping problems; gambling theory, Sums of independent random variables; random walks, Optimal stopping in statistics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
