Strategy improvement for concurrent reachability games

Third International Conference on the Quantitative Evaluation of Systems, QEST 2006

Volumn , Issue , 2006, Pages 291-300

  Chatterjee, Krishnendu ^a   De Alfaro, Luca ^b   Henzinger, Thomas A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADVANCED PUISIEUX SERIES ANALYSIS; CONCURRENT REACHABILITY GAMES; STRATEGY IMPROVEMENT;

ALGORITHMS; GRAPH THEORY; PROBABILITY DISTRIBUTIONS;

GAME THEORY;

EID: 41149112565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2006.37     Document Type: Conference Paper

References (18)

1. D.P. Bertsekas. Dynamic Programming and Optimal Control, volumes I and II. Athena Scientific, 1995.
2. K. Chatterjee and T.A. Henzinger. Strategy improvement for stochastic Rabin and Strett Games In Concurrency Theory, LNCS 4137, page 375-389. Springer, 2006.
3. K. Chatterjee, R.Majumdar, and M. Jurdziński. On Nash equilibria in stochastic games. In Computer Science Logic, LNCS 3210, pages 26-40. Springer, 2004.
4. A. Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.
5. A. Condon. On algorithms for simple stochastic games. In Advances in Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 51-73. American Mathematical Society, 1993.
6. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42:857-907, 1995.
7. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601.
8. L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proc. 15th Symp. Logic in Computer Science, pages 141-154. IEEE Computer Society, 2000.
9. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In Proc. 39th Symp. Foundations of Computer Science, pages 564-575. IEEE Computer Society, 1998.
10. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. Journal of Computer and System Sciences, 68:374-397, 2004.
11. C. Derman. Finite-State Markovian Decision Processes. Academic Press, 1970.
12. K. Etessami and M. Yannakakis. Recursive concurrent stochastic games. In International Colloquium on Automata, Languages, and Programming, LNCS. Springer, 2006. To appear.
13. H. Everett. Recursive games. In Contributions to the Theory of Games III, volume 39 of Annals of Mathematical Studies, pages 47-78, 1957.
14. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1997.
15. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. Van Nostrand, 1966.
16. D.A. Martin. The determinacy of Blackwell games. The Journal of Symbolic Logic, 63:1565-1581, 1998.
17. L.S. Shapley. Stochastic games. Proc. National Academy of Sciences (USA), 39:1095-1100, 1953.
18. J. Vöge and M. Jurdziński. A discrete strategy improvement algorithm for solving parity games. In Computer Aided Verification, pages 202-215. LNCS 1855, Springer, 2000.