Value iteration

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

Volumn 5000 LNCS, Issue , 2008, Pages 107-138

  Chatterjee, Krishnendu ^a   Henzinger, Thomas A ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; GRAPH THEORY; ITERATIVE METHODS; PROBABILITY; RISK ASSESSMENT;

COMPUTER AIDED VERIFICATION; CONVERGENCE RATES; FIXPOINT COMPUTATIONS; GAME SOLVING; GRAPH STRUCTURES; INTERNATIONAL CONFERENCES; LEVEL-1; PERFORMANCE ANALYSES; VALUE ITERATION;

MODEL CHECKING;

EID: 48949105854     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69850-0_7     Document Type: Conference Paper

References (35)

1. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49, 672-713 (2002)
2. Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource Interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 117-133. Springer, Heidelberg (2003)
3. Chatterjee, K.: Concurrent games with tail objectives. Technical Report EECS-2005-1385, UC Berkeley (2005)
4. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of quantitative concurrent parity games. In: SODA 2006, pp. 678-687. ACM-SIAM (2006)
5. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Strategy improvement for concurrent reachability games. In: QEST 2006, pp. 291-300. IEEE (2006)
6. Chatterjee, K., Henzinger, T.A.: Reduction of stochastic parity to stochastic meanpayoff games. Technical Report EECS-2006-140, UC Berkeley (2006)
7. Henzinger, T.A., Chatterjee, K.: Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 512-523. Springer, Heidelberg (2006)
8. Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA 2004, pp. 121-130. ACM-SIAM (2004)
9. Chatterjee, K., Majumdar, R., Henzinger, T.A.: Stochastic limit-average games are in EXPTIME. Technical Report EECS-2006-143, UC Berkeley (2006)
10. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)
11. Condon, A.: The complexity of stochastic games. Information and Computation 96, 203-224 (1992)
12. Condon, A.: On algorithms for simple stochastic games. In: Advances in Computational Complexity Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 51-73. AMS (1993)
13. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42, 857-907 (1995)
14. de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1997)
15. de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022-1037. Springer, Heidelberg (2003)
16. de Alfaro, L., Majumdar, R.: Quantitative solution of ω-regular games. Journal of Computer and System Sciences 68, 374-397 (2004)
17. Emerson, E.A., Jutla, C.: Tree automata, μ-calculus, and determinacy. In: FOCS 1991, pp. 368-377. IEEE (1991)
18. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer (1997)
19. Gimbert, H., Zielonka, W.: Discounting infinite games, but how and why? ENTCS 119, 3-9 (2005)
20. Jurdziński, M.: Deciding the winner in parity games is in UP ∩ coUP. Information Processing Letters 68, 119-124 (1998)
21. Jurdziński, M.: Small Progress Measures for Solving Parity Games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290-301. Springer, Heidelberg (2000)
22. Jurdziński, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. In: SODA 2006, pp. 117-123. ACM-SIAM (2006)
23. Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23, 309-311 (1978)
24. Vardi, M.Y., Kupferman, O., King, V.: On the Complexity of Parity Word Automata. In: Honsell, F., Miculan, M. (eds.) ETAPS 2001 and FOSSACS 2001. LNCS, vol. 2030, pp. 276-286. Springer, Heidelberg (2001)
25. Liggett, T.A., Lippman, S.A.: Stochastic games with perfect information and time average payoff. SIAM Review 11, 604-607 (1969)
26. Littman, M.L.: Algorithms for Sequential Decision Making. PhD thesis, Brown University (1996)
27. Madani, O.: Polynomial value iteration algorithms for deterministic MDPs. In: UAI 2002, pp. 311-318. Morgan Kaufmann (2002)
28. Mertens, J.F., Neyman, A.: Stochastic games. International Journal of Game Theory 10, 53-66 (1981)
29. Safra, S.: On the complexity of ω-automata. In: FOCS 1988, pp. 319-327. IEEE (1988)
30. Shapley, L.S.: Stochastic games. Proceedings of the National Academy of Sciences 39, 1095-1100 (1953)
31. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389-455. Springer (1997)
32. Tseng, P.: Solving H-horizon stationary Markov decision problems in time proportional to log(H). Operations Research Letters 9, 287-297 (1990)
33. Vöge, J., Jurdziński, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202-215. Springer, Heidelberg (2000)
34. Wadge, W.W.: Reducibility and Determinateness of Baire Spaces. PhD thesis, UC Berkeley (1984)
35. Zwick, U., Paterson, M.: The complexity of mean-payoff games on graphs. Theoretical Computer Science 158, 343-359 (1996)