Recursive stochastic games with positive rewards

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 711-723

  Etessami, Kousha ^a   Wojtczak, Dominik ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Columbia University ^*

Author keywords

[No Author keywords available]

Indexed keywords

FINITE STATES; MARKOV DECISION PROCESSES; OPTIMAL STRATEGIES; OPTIMAL VALUES; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; RECURSION; RUNNING TIME; SIMPLE STOCHASTIC GAMES; STOCHASTIC GAMES; ZERO-SUM STOCHASTIC GAMES;

CHLORINE COMPOUNDS; GAME THEORY; LINGUISTICS; MARKOV PROCESSES; MATHEMATICAL MODELS; NUCLEAR PROPULSION; OPTIMAL SYSTEMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; RECURSIVE FUNCTIONS; STANDARDS; STOCHASTIC CONTROL SYSTEMS; STOCHASTIC PROGRAMMING; TRANSLATION (LANGUAGES); TURBULENT FLOW;

STOCHASTIC MODELS;

EID: 49049108333     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_58     Document Type: Conference Paper

References (28)

1. Brázdil, T., Brozek, V., Forejt, V., Kucera, A.: Reachability in recursive markov decision processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137. Springer, Heidelberg (2006)
2. Condon, A.: The complexity of stochastic games. Inf.&Comp. 96, 203-224 (1992)
3. Condon, A., Melekopoglou, M.: On the complexity of the policy iteration algorithm for stochastic games. ORSA Journal on Computing 6(2) (1994)
4. Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic models of Proteins and Nucleic Acids. Cambridge U. Press, Cambridge (1999)
5. Esparza, J., Kučera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: LICS, pp. 12-21 (2004)
6. Esparza, J., Kučera, A., Mayr, R.: Quantitative analysis of probabilistic pushdown automata: expectations and variances. In: Proc. of 20th IEEE LICS 2005 (2005)
7. Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of non-linear equations. In: Proc. of 22nd STACS (2005), http://homepages.inf.ed.ac.uk/kousha/bib index.html
8. Etessami, K., Yannakakis, M.: Recursive markov decision processes and recursive stochastic games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580. Springer, Heidelberg (2005)
9. Etessami, K., Yannakakis, M.: Efficient qualitative analysis of classes of recursive markov decision processes and simple stochastic games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884. Springer, Heidelberg (2006)
10. Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. In: Proc. of 48th IEEE FOCS (2007)
11. Etessami, K., Wojtczak, D., Yannakakis, M.: Recursive stochastic games with positive rewards. Tech report EDI-INF-RR-1224 (July 2007)
12. Fagin, R., Karlin, A., Kleinberg, J., Raghavan, P., Rajagopalan, S., Rubinfeld, R., Sudan, M., Tomkins, A.: Random walks with "back buttons". In: STOC (2000)
13. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
14. Gawlitza, T., Seidl, H.: Precise relational invariants through strategy iteration. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646. Springer, Heidelberg (2007)
15. Gawlitza, T.: Personal communication (April 2008)
16. Haccou, P., Jagers, P., Vatutin, V.A.: Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge U. Press, Cambridge (2005)
17. Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)
18. Hoffman, A., Karp, R.: On nonterminating stochastic games. Manag. Sci. 12, 359-370 (1966)
19. Johnson, D.S., Papadimitriou, C., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79-100 (1988)
20. Juba, B.: On the hardness of simple stochastic games. Master's thesis, CMU (2006)
21. Manning, C., Schütze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)
22. Martin, D.A.: Determinacy of Blackwell games. J. Sym. Log. 63, 1565-1581 (1998)
23. Neyman, A., Sorin, S. (eds.): Stochastic Games and Applications. Kluwer, Dordrecht (2003)
24. Pliska, S.: Optimization of multitype branching processes. Management Sci. 23, 117-124 (1976)
25. Puterman, M.L.: Markov Decision Processes. Wiley, Chichester (1994)
26. Rothblum, U., Whittle, P.: Growth optimality for branching Markov decision chains. Math. Oper. Res. 7(4), 582-601 (1982)
27. Veinott, A.F.: Discrete dynamic programming with sensitive discount optimality criteria. Ann. Math. Statist. 40, 1635-1660 (1969)
28. Wojtczak, D., Etessami, K.: Premo: an analyzer for probabilistic recursive models. In: Proc. of TACAS (2007), http://groups.inf.ed.ac.uk/premo/