Recognising the last record of sequence

Stochastics

Volumn 79, Issue 3-4, 2007, Pages 199-209

  Gnedin, Alexander ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Best choice problem; Chain records; Optimal stopping; Poisson paced; Stick breaking

Indexed keywords

EID: 34248183555     PISSN: 17442508     EISSN: 17442516     Source Type: Journal    
DOI: 10.1080/17442500600893027     Document Type: Conference Paper

References (29)

1. Arnold, B.C., Balakrishnan, N. and Nagaraja, H.N., 1998, Records (New York, NY: Wiley).
2. Baryshnikov, Yu.M. and Gnedin, A.V., 2001, Counting intervals in the packing process, The Annals of Applied Probability, 11, 863-877.
3. Berezovsky, B.A. and Gnedin, A.V., 1984, The Best Choice Problem (Moscow:Nauka) (in Russian).
4. Bertoin, J., 2006, Random Fragmentation and Coagulation Processes (Cambridge: Cambridge University Press).
5. Bertoin, J. and Caballero, M.-E., 2002, Entrance from 0 + for increasing semi-stable Markov processes, Bernoulli, 8, 195-205.
6. Bertoin, J. and Gnedin, A.V., 2004, Asymptotic laws for nonconservative self-similar fragmentations, Electronic Journal of Probability, 9, 575-593.
7. Bollobás, B. and Brightwell, G., 1991, Box spaces and random partial orders, Transactions of the American Mathematical Society, 124, 59-72.
8. Bruss, F.T., 1984, A unified approach to a class of best choice problems with an unknown number of options, The Annals of Probability, 12, 882-889.
9. Bruss, F.T., 2000, Sum the odds to one and stop, The Annals of Probability, 28, 1384-1391.
10. Bruss, F.T. and Delbaen, F., 2001, Optimal rules for the sequential selection of monotone subsequences of maximum expected length, Stochastic Processes and their Applications, 96, 313-342.
11. Devroye, L., 1999, Universal limit laws for depths in random trees, SIAM Journal on Computing, 28, 409-432.
12. Feller, W., 1971, An Introduction to Probability Theory and its Applications, Vol. 2 (New York, NY: Wiley).
13. Gilbert, J. and Mosteller, F., 1966, Recognizing the maximum of a sequence, Journal of the American Statistical Association, 61, 35-73.
14. Gnedin, A.V., 1996, On the full-information best-choice problem, Journal of Applied Probability, 33, 678-687.
15. Gnedin, A.V., 2004, Best choice from the planar Poisson process, Stochastic Processes and their Applications, 111, 317-354.
16. Gnedin, A.V., 2005, Objectives in the best-choice problems, Sequential Analysis, 24, 1-11.
17. Gnedin, A., 2005, Counting the chain records, available at arXiv.
18. Gnedin, A., 2006, Constrained exchangeable partitions, available at arXiv.
19. Gnedin, A. and Miretskiy, D., 2005, Winning rate in the full information best-choice problem, available at arXiv.
20. Gnedin, A. and Pitman, J., 2005, Regenerative composition structures, The Annals of Probability, 33, 445-479.
21. Goldie, C.M. and Bunge, J., 1999, Record sequences and their applications. In: D.N. Shanbhag and C.R. Rao (Eds.) Handbook of Statistics Vol. 19, (Stochastic Processes: Theory and Methods) (Amsterdam: North Holland), pp. 277-308.
22. Goldie, C.M. and Resnick, S., 1989, Records in a partially ordered set, The Annals of Probability, 17, 678-699.
23. Kühne, R. and Rüschendorf, L., 2000, Approximation of optimal stopping problems, Stochastic Processes and their Applications, 90, 301-325.
24. Nevzorov, V.B., 2001, Records. Transl. Math. Monographs, Providence, AMS.
25. Pfeifer, D., 1989, Extremal processes, secretary problems and the 1/e law, Journal of Applied Probability, 27, 722-733.
26. Pitman, J., 1995, Exchangeable and partially exchangeable random partitions, Probability Theory and Related Fields, 102, 145-158.
27. Samuels, S.M., 1982, Exact solutions for the full information best choice problem, Purdue University, Statistics Department, Mimeo Series, 82-17.
28. Samuels, S.M., 1991, Secretary problems, In: B.K. Ghosh and P.K. Sen (Eds.) Chapter 16. Handbook of Sequential Analysis (New York, NY: Marcel Dekker).
29. Samuels, S.M., 2004, Why do these quite different best-choice problems have the same solutions?, Advances in Applied Probability, 36, 398-416.