Best choice from the planar Poisson process

Stochastic Processes and their Applications

Volumn 111, Issue 2, 2004, Pages 317-354

  Gnedin, Alexander V ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Best choice problem; Optimal stopping; Planar Poisson process; Records

Indexed keywords

EID: 2342426777     PISSN: 03044149     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.spa.2003.12.005     Document Type: Article

References (33)

1. Arnold B.C. Balakrishnan N. Nagaraja H.N. Records 1998 Wiley New York
2. Berezovsky B.A. Gnedin A.V. The Best Choice Problem 1984 Nauka Moscow
3. Bojdecki T. On optimal stopping of independent random variables appearing to a renewal process with random time horizon Bol. Soc. Math. Mexicana 22 1977 35-40
4. Bojdecki T. On optimal stopping of a sequence of independent random variables-probability maximizing approach Stoch. Proc. Appl. 6 1978 153-163
5. Browne, S., 1994. Records, mixed Poisson processes and optimal selection: an intensity approach. Working Paper, Columbia University, New York.
6. Bruss F.T. Paindaveine D. Selecting a sequence of last successes in independent trials J. Appl. Probab. 37 2000 389-399
7. Bruss F.T. Rogers L.C.G. Embedding optimal selection problems in a Poisson process Stoch. Proc. Appl. 38 1991 267-278
8. Chaudhry M.A. Zubair S.M. On a Class of Incomplete Gamma Functions with Applications 2002 Chapman & Hall London, Boca Raton
9. Deuschel J.-D. Zeitouni O. Limiting curves for i.i.d. records Ann. Probab. 23 1995 852-878
10. Dynkin E.B. Yushkevitch A.A. Markov Processes: Theorems and Problems 1969 Plenum Press New York
11. Ferguson T.S Hardwick J.P. Tamaki M. Duration of owning a relatively best object Contemp. Math. 125 1992 37-57
12. Flatau J. Irle A. Optimal stopping for extremal processes Stoch. Proc. Appl. 16 1984 99-111
13. Gilbert J. Mosteller F. Recognizing the maximum of a sequence J. Amer. Stat. Assoc. 61 1966 35-73
14. Gnedin A.V. On the full-information best-choice problem J. Appl. Probab. 33 1996 678-687
15. Gnedin, A.V., 2004. Objectives in the best-choice problems. Sequential Anal., in press.
16. Gnedin A.V. Sakaguchi M. On a best-choice problem related to the Poisson process Contemp. Math. 125 1992 59-64
17. Goldie C.M. Records, permutations and greatest convex minorants Math. Proc. Cambridge Philos. Soc. 106 1989 169-177
18. Goldie, C.M., Bunge, J., 1999. Record sequences and their applications, in: Shanbhag, D.N., Rao, C.R. (Eds.), Handbook of Statistics, Vol. 19, Stochastic Processes: Theory and Methods. North-Holland, Amsterdam, pp. 277-308.
19. Goldie C.M. Resnick S.I. Many multivariate records Stoch. Proc. Appl. 59 1995 185-216
20. Kühne R. Rütschendorf L. Approximation of optimal stopping problems Stoch. Proc. Appl. 90 2000 301-325
21. Mazalov, V.V., Tamaki, M., 2002. An explicit formula for the limiting gain in the full information duration problem. Preprint, also reported on the Workshop on Optimal Stopping and Stochastic Games, 1-7 July, Bedlewo, Poland.
22. Nevzorov V.B. Records, Translations in Mathematical Monographs 2001 American Mathematical Society Providence, RI
23. Nielsen, N., 1906. Theorie des Integrallogarithmus und verwandter Transzendenten, Teubner, Leipzig (reprinted by Chelsea in 1965, available via the electronic library of Cornell University, http://cdl.library.cornell.edu/math_N.html
24. Petruccelli J.D. On a best choice problem with partial information Ann. Stat. 8 1980 1171-1174
25. Pfeifer D. Extremal processes, secretary problems and the 1/e law J. Appl. Probab. 27 1989 722-733
26. Porosinski Z. The full-information best choice problem with a random number of observations Stoch. Proc. Appl. 24 1987 293-307
27. Porosinski Z. On best choice problems having similar solutions Stat. Probab. Lett. 56 2002 321-327
28. Presman E.L. Sonin I.M. The best choice problem for a random number of objects Theor. Probab. Appl. 20 1972 770-781
29. Resnick S. Extreme Values, Regular Variation and Point Processes 1987 Springer New York
30. Sakaguchi M. Optimal stopping problems for randomly arriving offers Math. Japon. 21 1976 201-217
31. Samuels, S.M., 1982. Exact solutions for the full information best choice problem. Mimeo Series 82-17, Purdue University, Statist. Department.
32. Samuels S.M. Secretary problems In: Ghosh B.K. Sen P.K. (Eds.), Handbook of Sequential Analysis 1991 Marcel Dekker New York Chapter 16
33. Samuels, S.M., 2004. Why do these quite different best-choice problems have the same solutions? Adv. Appl. Prob. 36, in press.