The elimination algorithm for the problem of optimal stopping

Mathematical Methods of Operations Research

Volumn 49, Issue 1, 1999, Pages 111-123

  Sonin, Isaac ^a  

^a UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

Author keywords

Markov chain; Optimal stopping; Secretary problem; The elimination algorithm; The state reduction approach

Indexed keywords

EID: 0005591407     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Bertsekas DP (1987) Dynamic programming: Deterministic and stochastic models. Prentice-Hall, Englewood Cliffs, NJ
2. Berger JO, Berry DA (1986) The relevance of stopping rules in statistical inference. With discussion by Robert Keener, Adam T. Martinsek and Carl N. Morris and a reply by the authors. In: Statistical decision theory and related topics, IV, Vol. 1 Springer, New York-Berlin, pp. 29-72
3. Çinlar E (1975) Introduction to stochastic processes. Prentice-Hall, Englewood Cliffs, NJ
4. Chow YS, Moriguti S, Robbins H, Samuels SM (1964) Optimal selection based on optimal rank (the "secretary" problem). Israel J. Math. 2:81-90
5. Chow YS, Robbins H, Sigmund D (1971) Great expectations: The theory of optimal stopping. Houghton Mifflin Co., NY
6. Davis MHA, Karatzas I (1994) A deterministic approach to optimal stopping. In: Kelly FP (ed.) Probability, statistics and optimization. Wiley & Sons, NY
7. Dynkin EB, Yushkevich AA (1969) Markov processes. Theorems and problems. Plenum Press, NY
8. Feldman RM, Valdez-Flores C (1996) Applied probability and stochastic processes. PWS Publishing Company, Boston
9. Ferguson TS (1989) Who solved the secretary problem? Statistical Science 4:282-296
10. Freeman PR (1983) The secretary problem and its extensions; A review. Int. Statistical Review 51: 189-206
11. Gilbert J, Mosteller F (1966) Recognizing the maximum of a sequence. J. Amer. Stat. Assoc. 61: 35-73
12. Grassmann WK, Taksar MI, Heyrnan DP (1985) Regenerative analysis and steady-state distributions for Markov chains. Operat. Res. 33:1107-1116
13. Howard RA (1971) Dynamic probabilistic systems: v.l Markov models. Wiley&Sons, NY
14. Kemeny JG, Snell JL (1960) Finite Markov chains. Van Nostrand-Reinhold, NY
15. Lindley DV (1961) Dynamic programming and decision theory. Appl. Statist. 10:39-52
16. Meyer CD, Plemmons RJ (Eds.) (1993) Linear algebra, Markov chains, and queueing models. IMA Vol. Math. Appl., 48, Springer, New York
17. Presman EL, Sonin IM (1972) The best choice problem for a random number of objects. Theory Probab. Applic. 17:657-668
18. Puterman M (1994) Markov decision processes: Discrete stochastic dynamic programming. John Wiley & Sons, NY
19. Rose JS (1982) Twenty years of secretary problem, a survey of developments in the theory of optimal choice. Adv. in Management Studies 1:53-64
20. Samuels SM (1991) Secretary problems. In: Ghosh BK, Sen Pk (eds.) Handbook of sequential analysis, Marcel Dekker, Boston, pp. 381-4-5
21. Sheskin TJ (1985) A Markov partitioning algorithm for computing steady-state probabilities. Operat. Res. 33:228-235
22. Shiryayev AN (1978) Optimal stopping rules. Springer-Verlag, NY
23. Shiryayev AN (1984) Probability. Springer-Verlag, NY
24. Sonin IM (1995) Two simple theorems in the problems of optimal stopping. Proceed. INFORMS Appl. Probab. Conf., Atlanta, Georgia
25. Sonin IM (1998) The state reduction and related algorithms and their applications to the study of Markov chains, graph theory and the optimal stopping problem. Accepted for publication in Advances in Mathematics
26. Stochastic models and optimal stopping (1994) Proceed. Int. Conf., Nanzan Univ., Nagoya, Japan
27. Strategies for Sequential Search and Selection in Real Time (1992) Amer. Math. Soc., Providence, RI, In: Bruss F, Ferguson T, Samuels S. (eds.) Contemp. Math. 125, Amherst, MA