The Complexity of Solving Stochastic Games on Graphs-Reference-Cited by-同舟云学术

The Complexity of Solving Stochastic Games on Graphs

Published:2009 Issue: Volume: Page:112-121
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Andersson Daniel,Miltersen Peter Bro

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-10631-6_13.pdf

Reference17 articles.

1. Lecture Notes in Computer Science;D. Andersson,2008

2. Chatterjee, K., Henzinger, T.A.: Reduction of stochastic parity to stochastic mean-payoff games. Inf. Process. Lett. 106(1), 1–7 (2008)

3. Lecture Notes in Computer Science;K. Chatterjee,2003

4. Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA 2004: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 121–130 (2004)

5. Condon, A.: The complexity of stochastic games. Information and Computation 96, 203–224 (1992)

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Matrix norm based hybrid Shapley and iterative methods for the solution of stochastic matrix games;Applied Mathematics and Computation;2024-07

3. Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games;Lecture Notes in Computer Science;2024

4. Multi-objective ω-Regular Reinforcement Learning;Formal Aspects of Computing;2023-06-30

5. Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26