Recognising the last record of sequence

References

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