Optimal stopping on trajectories and the ballot problem

Abstract

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 P n and M n denote the respective numbers of plus balls and minus balls drawn by time n and define Z 0 = 0, Z n = P n - M n , 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.