Non-discounted optimal policies in controlled Markov set-chains

Journal of the Operations Research Society of Japan

Volumn 42, Issue 3, 1999, Pages 256-267

  Hosaka, Masanori ^a   Kurano, Masami ^b  

^a CHIBA UNIVERSITY   (Japan)

^b Faculty of Education   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033197046     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.42.256     Document Type: Article

References (22)

1. J. Bather: Optimal decision processes for finite Markov chains, Part II: Communicationsystems. Advances in Applied Probability, 5 (1973) 521-540.
2. D. P. Bertsekas and S. E. Shreve: Stochastic Optimal Control: The Discrete Time Case (Academic Press, New York, 1978).
3. D. Blackwell: Discrete dynamic programing. Annals of Mathematical Statistics, 33 (1962) 719-726.
4. G. B. Dantzig, J. Folkman and N. Shapiro: On the continuity of the minimum set of a continuous function. Journal of Mathematical Analysis and Applications, 17 (1967) 519-548.
5. ℳ. Proceedings of the American Mathematical Society, 81 (1981) 201-206.
6. D. J. Hartfiel: Component bounds for Markov set-chain limiting sets. Journal of Statistical Computation and Simulation, 38 (1991) 15-24.
7. D. J. Hartfiel: Cyclic Markov set-chains. Journal of Statistical Computation and Simulation, 46 (1993) 145-167.
8. D. J. Hartfiel and E. Seneta: On the theory of Markov set-chains. Advances in Applied Probability, 26 (1994) 947-964.
9. D. J. Hartfiel: Markov Set-Chains (Springer-Verlag, Berlin Heidelbergn, 1998).
10. K. Hinderer: Foundations of Non-Stationary Dynamic Programming with Discrete Time Parameter (Springer-Verlag, New York, 1970).
11. R. Howard: Dynamic Programming and Markov Processes (MIT Press, Cambridge MA, 1960).
12. J. G. Kemeny and J. L. Snell: Finite Markov Chains (Van Nostrand, New York, 1960).
13. K. Kuratowski: Topology (Academic, New York, 1966).
14. M. Kurano, J. Song, M. Hosaka and Y. Huang: Controlled Markov set-chains with discounting. Journal of Applied Probability, 35 (1998) 293-302.
15. A. Nenmaier: New techniques for the analyses of linear interval equations. Linear Algebra and Applications, 58 (1984) 273-325.
16. M. L. Puterman: Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, 1994).
17. E. Seneta: Nonnegative Matrices and Markov Chains (Springer-Verlag, New York, 1981).
18. J. Stoer and C. Witzgall: Convexity and Optimization in Finite Dimension 1 (Springer-Verlag, Berlin and New York, 1970).
19. Y. Takahashi: Weak D-Markov chain and its application to a queueing network. G. Iazeolla, P. J. Courtois, and A. Hordijk (eds.): Mathematical Computer Performance and Reliability (North-Holland, Amsterdam, 1984), 153-165.
20. Y. Takahashi: A weak D-Markov chain approach to tandem queueing networks. G. Iazeolla, P. J. Courtois, and A. Hordijk (eds.): Computer Performance and Reliability (North-Holland, Amsterdam, 1988), 151-159.
21. N. M. von Dijk: On the importance of bias-terms for error bounds and comparison results. W. J. Stwart. (ed.): Numerical Solution of Markov Chains (New York, Marcel Dekker, 1990), 617-642.
22. N. M. von Dijk: An error-bound theorem for approximate Markov chains. Probability in the Engineering and Informational Sciences, 6 (1992) 413-424.