Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-06T07:03:12.152Z Has data issue: false hasContentIssue false

Optimal stopping rules for directionally reinforced processes

Published online by Cambridge University Press:  01 July 2016

Pieter Allaart*
Affiliation:
University of North Texas
Michael Monticino*
Affiliation:
University of North Texas
*
Postal address: Mathematics Department, University of North Texas, Denton, TX 76203-1430, USA.
Postal address: Mathematics Department, University of North Texas, Denton, TX 76203-1430, USA.

Abstract

This paper analyzes optimal single and multiple stopping rules for a class of correlated random walks that provides an elementary model for processes exhibiting momentum or directional reinforcement behavior. Explicit descriptions of optimal stopping rules are given in several interesting special cases with and without transaction costs. Numerical examples are presented comparing optimal strategies to simpler buy and hold strategies.

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2001 

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.)

References

Böhm, W., (2000). The correlated random walk with boundaries: a combinatorial solution. J. Appl. Prob. 37, 470479.Google Scholar
Bruss, F. T. and Paindaveine, D. (2000). Selecting a sequence of last successes in independent trials. J. Appl. Prob. 37, 389399.CrossRefGoogle Scholar
Chen, A. Y. and Renshaw, E. (1994). The general correlated random walk. J. Appl. Prob. 31, 869884.Google Scholar
Chow, Y. S., Robbins, H. and Siegmund, D. (1971). Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, Boston.Google Scholar
Gilbert, J. P. and Mosteller, F. (1966). Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 3573.CrossRefGoogle Scholar
Gillis, J. (1955). Correlated random walk. Proc. Camb. Phil. Soc. 51, 639651.Google Scholar
Haggstrom, G. W. (1966). Optimal stopping and experimental design. Ann. Math. Statist. 37, 729.CrossRefGoogle Scholar
Horváth, L. and Shao, O. M. (1998). Limit distributions of directionally reinforced random walks. Adv. Math. 134, 367383.Google Scholar
Kao, M. Y. and Tate, S. R. (1999). On-line difference maximization. SIAM J. Discrete Math. 12, 7890.Google Scholar
Majumdar, A. A. K. (1983). Optimal stopping based on success runs for an urn with three types of balls. Ganit 3, 130.Google Scholar
Majumdar, A. A. K. (1989). Optimal stopping based on success or failure run. Indian J. Math. 31, 175192.Google Scholar
Majumdar, A. A. K. and Sakaguchi, M. (1983). Optimal stopping for the urn problem with random termination. Math. Japon. 28, 271285.Google Scholar
Mauldin, R. D., Monticino, M. G. and Von Weizsäcker, H. (1996). Directionally reinforced random walks. Adv. Math. 117, 239252.Google Scholar
Mohan, C. (1955). The gamblerés ruin problem with correlation. Biometrika 42, 486493.CrossRefGoogle Scholar
Mukherjea, A. and Steele, D. (1986). Conditional expected durations of play given the ultimate outcome for a correlated random walk. Statist. Prob. Lett. 4, 237243.Google Scholar
Mukherjea, A. and Steele, D. (1987). Occupation probability of a correlated random walk and a correlated ruin problem. Statist. Prob. Lett. 5, 105111.Google Scholar
Ross, S. M. (1975). A note on optimal stopping for success runs. Ann. Statist. 3, 793795.Google Scholar
Stadje, W. (1985). On multiple stopping rules. Optimization 16, 401418.Google Scholar
Starr, N. (1972). How to win a war if you must: optimal stopping based on success runs. Ann. Math. Statist. 43, 18841893.Google Scholar
Zhang, Y. L. (1992). Some problems on a one-dimensional correlated random walk with various types of barrier. J. Appl. Prob. 29, 196201.Google Scholar