Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T10:37:54.122Z Has data issue: false hasContentIssue false

Optimal stopping on trajectories and the ballot problem

Published online by Cambridge University Press:  14 July 2016

Mitsushi Tamaki*
Affiliation:
Aichi University
*
∗ Postal address: Department of Business Administration, Aichi University, Nagoya Campus, 370 Kurozasa Miyoshi, Nishikamo, Aichi 470–0296, Japan. Email address: tamaki@vega.aichi-u.ac.jp

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.

Information

Type
Research Papers
Copyright
Copyright © by the 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.)

Article purchase

Temporarily unavailable