Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-28T04:43:21.335Z Has data issue: false hasContentIssue false

Optimal Stopping in a Dice Game

Published online by Cambridge University Press:  14 July 2016

Markus Roters*
Affiliation:
Universität Trier
*
Postal address: FB IV Mathematik/Statistik, Universität Trier, D-54286 Trier, Germany

Abstract

In this paper we consider an explicit solution of an optimal stopping problem arising in connection with a dice game. An optimal stopping rule and the maximum expected reward in this problem can easily be computed by means of the distributions involved and the specific rules of the game

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1998 

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

Chow, Y. S., Robbins, H., and Siegmund, D. (1991). The Theory of Optimal Stopping. Dover, New York.Google Scholar
Dubins, L. E., and Teicher, H. (1967). Optimal stopping when the future is discounted. Ann. Math. Statist. 38, 601605.Google Scholar
Ferguson, T. S. (1976). Stopping a sum during a success run. Ann. Statist. 4, 252264.Google Scholar
Gut, A. (1988). Stopped Random Walks. Limit Theorems and Applications. Springer, New York.Google Scholar
Haggstrom, G. W. (1967). Optimal sequential procedures when more than one stop is required. Ann. Math. Statist. 38, 16181626.CrossRefGoogle Scholar
Karlin, S., and Taylor, H. M. (1981). A Second Course in Stochastic Processes. Academic Press, Boston.Google Scholar
Schäl, M. (1990). Markoffsche Entscheidungsprozesse. Teubner, Stuttgart.CrossRefGoogle Scholar