A decomposition algorithm for limiting average Markov decision problems

Operations Research Letters

Volumn 31, Issue 6, 2003, Pages 473-476

  Abbad, Mohammed ^a   Boustique, Hatim ^a  

^a FACULTÉ DES SCIENCES   (Morocco)

Author keywords

Communicating classes; Decomposition

Indexed keywords

ALGORITHMS; DECISION THEORY; GRAPH THEORY; MARKOV PROCESSES;

COMMUNICATING CLASSES;

OPERATIONS RESEARCH;

EID: 0141615758     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00055-5     Document Type: Article

References (11)

1. Abbad M., Daoui C., Algorithms for aggregated limiting average Markov decision problems. Math. Methods Oper. Res. 53(3):2001;451-463.
2. Avsar Z.M., Baykal-Gursoy M. A decomposition approach for undiscounted two person zero-sum stochastic games. Math. Methods Oper. Res. 49(3):1999;483-500.
3. Blackwell D. Discrete dynamic programming. Ann. Math. Statist. 33:1962;719-726.
4. Derman C. Finite State Markovian Decision Processes. 1970;Academic Press, New York.
5. Filar J.A., Schultz T.A. Communicating MDPs. equivalence and properties Oper. Res. Lett. 7(6):1988;303-307.
6. M. Gondran, M. Minoux, Graphes et Algorithmes, 2nd Edition, Eyrolles, Paris, 1990.
7. Haviv M., Puterman M.L. An improved algorithm for solving communicating average reward Markov decision. Ann. Oper. Res. 28:1991;229-242.
8. Howard R.A. Dynamic Programming and Markov Processes. 1960;Wiley, New York.
9. L.C.M. Kallenberg, Linear Programming and Finite Markovian Control Problems, Mathematical Centre Tracts, Vol. 148, Amsterdam, 1983.
10. Ross K.W., Varadarajan R. Multichain Markov decision processes with a sample path constraint. a decomposition approach Math. Oper. Res. 16:1991;195-207.
11. White D.J. Real applications of Markov decision processes. Interfaces. 15(6):1985;73-83.