Skip to main content Accessibility help
×
Home

Urn sampling distributions giving alternate correspondences between two optimal stopping problems

  • Mitsushi Tamaki (a1)

Abstract

The best-choice problem and the duration problem, known as versions of the secretary problem, are concerned with choosing an object from those that appear sequentially. Let (B,p) denote the best-choice problem and (D,p) the duration problem when the total number N of objects is a bounded random variable with prior p=(p 1, p 2,...,p n ) for a known upper bound n. Gnedin (2005) discovered the correspondence relation between these two quite different optimal stopping problems. That is, for any given prior p, there exists another prior q such that (D,p) is equivalent to (B,q). In this paper, motivated by his discovery, we attempt to find the alternate correspondence {p(m),m≥0}, i.e. an infinite sequence of priors such that (D,p(m-1)) is equivalent to (B,p(m)) for all m≥1, starting with p(0)=(0,...,0,1). To be more precise, the duration problem is distinguished into (D 1,p) or (D 2,p), referred to as model 1 or model 2, depending on whether the planning horizon is N or n. The aforementioned problem is model 1. For model 2 as well, we can find the similar alternate correspondence {p[m],m≥ 0}. We treat both the no-information model and the full-information model and examine the limiting behaviors of their optimal rules and optimal values related to the alternate correspondences as n→∞. A generalization of the no-information model is given. It is worth mentioning that the alternate correspondences for model 1 and model 2 are respectively related to the urn sampling models without replacement and with replacement.

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
Berezovsky, B. A. and Gnedin, A. V. (1984).The Problem of Best Choice.Nauka,Moscow (in Russian).
Bruss, F. T. (2000).Sum the odds to one and stop.Ann. Prob. 28,13841391.
Ferguson, T. S.,Hardwick, J. P. and Tamaki, M. (1992).Maximizing the duration of owning a relatively best object.Contemp. Math. 125,3757.
Gilbert, J. P. and Mosteller, F. (1966).Recognizing the maximum of a sequence.J. Amer. Statist. Assoc. 61,3573.
Gnedin, A. V. (1996).On the full information best-choice problem.J. Appl. Prob. 33,678687.
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.Sequential Anal. 24,177188.
Irle, A. (1980).On the best choice problem with random population size.Z. Operat. Res. Ser. A-B 24,177190.
Petruccelli, J. D. (1983).On the best-choice problem when the number of observations is random.J. Appl. Prob. 20,165171.
Porosiński, Z. (1987).The full-information best choice problem with a random number of observations.Stoch. Process. Appl. 24,293307.
Porosiński, Z. (2002).On best choice problems having similar solutions.Statist. Prob. Lett. 56,321327.
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. (1991).Secretary problems. In Handbook of Sequential Analysis,Dekker,New York, pp. 381405.
Samuels, S. M. (2004).Why do these quite different best-choice problems have the same solutions?Adv. Appl. Prob. 36,398416.
Szajowski, K. (1992).On nonzero sum game with priority in the secretary problem.Math. Japon. 37,415426.
Szajowski, K. (1993).Double stopping by two decision-makers.Adv. Appl. Prob. 25,438452.
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.
Tamaki, M. (2013).Optimal stopping rule for the no-information duration problem with random horizon.Adv. Appl. Prob. 45,10281048.
Tamaki, M. (2016).Optimal stopping rule for the full-information duration problem with random horizon.Adv. Appl. Prob. 48,5268.

Keywords

MSC classification

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