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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
