We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
An urn contains m minus balls and p plus balls, and we draw balls from this urn one at a time randomly without replacement until we wish to stop. Let Pn and Mn denote the respective numbers of plus balls and minus balls drawn by time n and define Z0 = 0, Zn = Pn - Mn, 1 ≤ n ≤ m + p. The main problem of this paper is to stop with maximum probability on the maximum of the trajectory formed by 
. This problem is closely related to the celebrated ballot problem, so that we obtain some identities concerning the ballot problem and then derive the optimal stopping rule explicitly. Some related modifications are also studied.
