|
[1] Bairamov, I., Berred, A. and Stepanov, A. (2010). Limit results for ordered uniform spacings. Stat. Pap. 51, 227–240. [2] Bruss, F.T. (2000). Sum the odds to one and stop. Ann. Probab. 28, 1384–1391. [3] Chan, T. (1996). Some diffusion models for the Mabinogion sheep problem of Williams. Adv. Appl. Probab. 28, 763–783. [4] Chow, Y.-S., Moriguti, S., Robbins, H. and Samuels, S.M. (1964). Optimal selection based on relative rank. Israel J. Math. 2, 81–90. [5] Chow, Y.-S., Robbins, H. and Siegmund, D. (1971). Great Expectations: the Theory of Optimal Stopping. Houghton Mifflin, Boston, MA. [6] Darling, D.A. (1953). On a class of problems relating to the random division of an interval. Ann. Math. Statist. 24, 239–253. [7] Devroye, L. (1981). Laws of the iterated logarithm for order statistics of uniform spacings. Ann. Probab. 9, 860–867. [8] Drobot, V. (1981). Uniform partitions of an interval. Trans. Amer. Math. Soc. 268, 151–160. [9] Ferguson, T.S. (1989). Who solved the secretary problem? Statistical Science 4, 282–296. [10] Ferguson, T.S. Optimal Stopping and Applications. Mathematics Department, UCLA. http:// www.math.ucla.edu/∼tom/Stopping/Contents.html. [11] Feller, W. (1966). An Introduction to Probability Theory and Its Applications, Vol. 2. Wiley, New York. [12] Fisher, R.A. (1929). Tests of significance in harmonic analysis. Proc. R. Soc. London. A 125, 54–59. [13] Fisher, R.A. (1940). On the similarity of the distribution found for tests of significance in harmonic analysis and in Stevens’ problem in geometrical probability. Ann. Eugenics. London. 10, 14–17. [14] Flajolet, P. and Huillet, T. (2008). Analytic combinatorics of the Mabinogion urn. Discrete Math. Theoret. Computer Sci. AI, 549–572. [15] Flatto, L. and Konheim, A. (1962). The random division of an interval and the random covering of a circle. SIAM Rev. 4, 211–222. [16] Freeman, P. R. (1983). The secretary problem and its extensions–a review. Int. Statist. Rev. 51, 189– 206. [17] Gilbert, J. and Mosteller, F. (1966). Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35–73. [18] Graham, R., Knuth, D., and Patashnik, O. (1994). Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Professional. [19] Greenwood, M. (1946). The statistical study of infectious diseases. J. R. Statist. Soc. A. 109, 85– 110. [20] Gusein-Zade, S.M. (1966) The problem of choice and the optimal stopping rule for a sequence of independent trials. Theory Prob. Appl. 11, 472–476. [21] Holst, L. (1980). On the lengths of the pieces of a stick broken at random. J. Appl. Prob. 17, 623– 634. [22] Hsiau, S.-R. and Yang, J.-R. (2000). A natural variation of the standard secretary problem. Statistica Sinica. 10, 639–646. [23] Kendall, M.G. and Moran, P.A.P. (1963). Geometrical Probability. Griffin, London. [24] Lindley, D.V. (1961). Dynamic programming and decision theory. Appl. Statist. 10, 39–51. [25] Mucci, A.G. (1973a). Differential equations and optimal choice problems. Ann. Statist. 1, 104–113. [26] Mucci, A.G. (1973b). On a class of secretary problems. Ann. Probab. 1, 417–427. [27] Petruccelli, J. D. (1983). On the best-choice problem when the number of observations is random. J. Appl. Prob. 20, 165–171. [28] Presman, E. L. and Sonin, I. M (1972). The best choice problem for a random number of objects. Theory Prob. Appl. 17, 657–668. [29] Pyke, R. (1965). Spacings (with discussion). J. R. Statist. Soc. B. 27, 395–449. [30] Rasmussen, W.T. and Robbins, H. (1975). The candidate problem with unknown population size. J. Appl. Prob. 12, 692–701. [31] Rose, J.S. (1982). A problem of optimal choice and assignment. Oper. Res. 30, 172–181 [32] Sakaguchi, M. (1978). Dowry problems and OLA policies. Rep. Statist. Appl. Res. Un. Japan. Sci. Engrs. 25, 124–128. [33] Samuel-Cahn, E. (1995). The best-choice secretary problem with random freeze on jobs. Rep. Stoch. Process. Appl. 55, 315–327. [34] Samuels, S.M. (1991). Secretary problems. In Handbook of Sequential Analysis (Statist. Textbooks Monogr. 118), eds B. K. Gosh and P.K. Sen, Marcel Dekker, New York, pp. 381–405. [35] Slud, E. (1978). Entropy and maximal spacings for random partitions. Z. Wahrsch. Verw. Gebiete. 41, 341–352. [36] Tamaki, M. (1979). Recognizing both the maximum and the second maximum of a sequence. J. Appl. Prob. 16, 803–812. [37] Vanderbei, R.J. (2012). The postdoc variant of the secretary problem. Tech. Report. http:// www.princeton.edu/∼rvdb/tex/PostdocProblem/PostdocProb.pdf [38] Wald, A. (1947). Sequential Analysis. Wiley, New York; Chapman & Hall, London. [39] Williams, D. (1991). Probability with Martingales. Cambridge University Press. [40] Wilson, J.G. (1991). Optimal choice and assignment of the best m of n randomly arriving items. Stoch. Process. Appl. 39, 325–343.
|