Efficient qualitative analysis of classes of recursive Markov decision processes and simple stochastic games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3884 LNCS, Issue , 2006, Pages 634-645

  Etessami, Kousha ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NON-PROBABILISTIC ACTIONS; POLYNOMIAL TIME; RECURSIVE MARKOV DECISION PROCESSES (RMDP); RECURSIVE SIMPLE STOCHASTIC GAMES (RSSG);

ALGORITHMS; DECISION THEORY; GAME THEORY; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; RECURSIVE FUNCTIONS;

MARKOV PROCESSES;

EID: 33745621018     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_52     Document Type: Conference Paper

References (22)

1. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. W. Reps, and M. Yannakakis. Analysis of recursive state machines. In ACM Trans. Progr. Lang. Sys., 27:786-818, 2005.
2. T. Brázdil, A. Kučera, and O. Stražovský. Decidability of temporal properties of probabilistic pushdown automata. In Proc. of STACS'05, 2005.
3. A. Condon. The complexity of stochastic games. Inf. & Comp., 96(2):203-224, 1992.
4. E. V. Denardo and U. G. Rothblum. Totally expanding multiplicative systems, unpublished manuscript, submitted, 2005.
5. E. V. Denardo and U. G. Rothblum. A turnpike theorem for a risk-sensitive Markov decision process with stopping, unpublished manuscript, submitted, 2005.
6. J. Esparza, A. Kučera, and R. Mayr. Model checking probabilistic pushdown automata. In Proc. of 19th IEEE LICS'04, 2004.
7. C. J. Everett and S. Ulam. Multiplicative systems, part i., ii, and iii. Technical Report 683,690,707, Los Alamos Scientific Laboratory, 1948.
8. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In Proc. of 22nd STACS'05. Springer, vol. 3404 of LNCS, 2005.
9. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic state machines. In Proc. 11th TACAS'05, Springer, vol. 3440 of LNCS, 2005.
10. K. Etessami and M. Yannakakis. Recursive Markov decision processes and recursive stochastic games. In Proc. of Send Int. Coll. on Automata, Languages, and Programming (ICALP'05), Springer, vol. 3580 of LNCS, 2005.
11. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1997.
12. M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP-complete geometric problems. In 8th ACM STOC, pages 10-22, 1976.
13. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 2nd edition, 1993.
14. T. E. Harris. The Theory of Branching Processes. Springer-Verlag, 1963.
15. R. J. Horn and C. R. Johnson. Matrix Analysis. Cambridge U. Press, 1985.
16. P. Jagers. Branching Processes with Biological Applications. Wiley, 1975.
17. K. Mahler. An inequality for the discriminant of a polynomial. Michigan Math J., 11:257-262, 1964.
18. D. A. Martin. Determinacy of Blackwell games. J. Symb. Logic, 63(4):1565-1581, 1998.
19. C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
20. M. L. Puterman. Markov Decision Processes. Wiley, 1994.
21. U. G. Rothblum, P. Whittle. Growth optimality for branching Markov decision chains. Math, of Operations Research, 7: 582-601, 1982.
22. Y. Sakakibara, M. Brown, R. Hughey, I.S. Mian, K. Sjolander, R. Underwood, and D. Haussler. Stochastic context-free grammars for tRNA modeling. Nucleic Acids Research, 22(23):5112-5120, 1994.