Skip to main content Accessibility help
×
Home

Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon

  • Mitsushi Tamaki (a1)

Abstract

As a version of the secretary problem, Ferguson, Hardwick and Tamaki (1992) considered an optimal stopping problem called the duration problem. The basic duration problem is the classical duration problem, in which the objective is to maximize the time of possession of a relatively best object when a known number of rankable objects appear in random order. In this paper we generalize this classical problem in two directions by allowing the number N (of available objects) to be a random variable with a known upper bound n and also allowing the objects to appear in accordance with Bernoulli trials. Two models can be considered for our random horizon duration problem according to whether the planning horizon is N or n. Since the form of the optimal rule is in general complicated, our main concern is to give to each model a sufficient condition for the optimal rule to be simple. For N having a uniform, generalized uniform, or curtailed geometric distribution, the optimal rule is shown to be simple in the so-called secretary case. The asymptotic results, as n → ∞, will also be given for these priors.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon
      Available formats
      ×

Copyright

Corresponding author

Postal address: Department of Business Administration, Aichi University, Nagoya Campus, Hiraike 4-60-6, Nakamura, Nagoya, Aichi 453-8777, Japan. Email address: tamaki@vega.aichi-u.ac.jp

References

Hide All
Bruss, F. T. (2000). Sum the odds to one and stop. Ann. Prob. 28, 13841391.
Dynkin, E. B. and Yushkevich, A. A. (1969). Markov Processes: Theorems and Problems. Plenum Press, New York.
Ferguson, T. S. (2008). The sum-the-odds theorem with application to a stopping game of Sakaguchi. Preprint.
Ferguson, T. S., Hardwick, J. P. and Tamaki, M. (1992). Maximizing the duration of owning a relatively best object. In Strategies for Sequential Search and Selection in Real Time (Contemp. Math. 125), American Mathematical Society, Providence, RI, pp. 3757.
Gilbert, J. P. and Mosteller, F. (1966). Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 3573.
Gnedin, A. V. (2004). Best choice from the planar Poisson process. Stoch. Process. Appl. 111, 317354.
Gnedin, A. V. (2005). Objectives in the best-choice problems. Sequent. Anal. 24, 177188.
Mazalov, V. V. and Tamaki, M. (2006). An explicit formula for the optimal gain in the full-information problem of owning a relatively best object. J. Appl. Prob. 43, 87101.
Mucci, A. G. (1973a). Differential equations and optimal choice problem. Ann. Statist. 1, 104113.
Mucci, A. G. (1973b). On a class of secretary problems. Ann. Prob. 1, 417427.
Pearce, C. E. M., Szajowski, K. and Tamaki, M. (2012). Duration problem with multiple exchanges. Numer. Algebra Control Optimization 2, 333355.
Petruccelli, J. D. (1983). On the best-choice problem when the number of observations is random. J. Appl. Prob. 20, 165171.
Presman, E. L. and Sonin, I. M. (1972). The best choice problem for a random number of objects. Theory. Prob. Appl. 17, 657668.
Samuels, S. M. (2004). Why do these quite different best-choice problems have the same solutions? Adv. Appl. Prob. 36, 398416.
Suchwalko, A. and Szajowski, K. (2002). Non standard, no information secretary problems. Sci. Math. Japonicae 56, 443456.
Tamaki, M. (2010). Sum the multiplicative odds to one and stop. J. Appl. Prob. 47, 761777.
Tamaki, M. (2011). Maximizing the probability of stopping on any of the last m successes in independent Bernoulli trials with random horizon. Adv. Appl. Prob. 43, 760781.

Keywords

MSC classification

Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon

  • Mitsushi Tamaki (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed