Document Open Access Logo

A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games

Authors Raphaël Berthon , Joost-Pieter Katoen , Zihan Zhou

PDF

File

Thumbnail PDF
PDF
LIPIcs.CONCUR.2025.9.pdf
  • Filesize: 1.31 MB
  • 21 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Probabilistic computation
Keywords
  • stochastic games
  • parity
  • reduction

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Significant progress has been recently achieved in developing efficient solutions for simple stochastic games (SSGs), focusing on reachability objectives. While reductions from stochastic parity games (SPGs) to SSGs have been presented in the literature through the use of multiple intermediate game models, a direct and simple reduction has been notably absent. This paper introduces a novel and direct polynomial-time reduction from quantitative SPGs to quantitative SSGs. By leveraging a gadget-based transformation that effectively removes the priority function, we construct an SSG that simulates the behavior of a given SPG. We formally establish the correctness of our direct reduction. Furthermore, we demonstrate that under binary encoding this reduction is polynomial, thereby directly corroborating the known NP ∩ coNP complexity of SPGs and providing new understanding in the relationship between parity and reachability objectives in turn-based stochastic games.

Cite As Get BibTex

Raphaël Berthon, Joost-Pieter Katoen, and Zihan Zhou. A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games. In 36th International Conference on Concurrency Theory (CONCUR 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 348, pp. 9:1-9:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CONCUR.2025.9

Author Details

Raphaël Berthon
  • RWTH Aachen University, Germany
Joost-Pieter Katoen
  • RWTH Aachen University, Germany
Zihan Zhou
  • National University of Singapore, Singapore

Funding

  • Berthon, Raphaël: Funded by DFG Project POMPOM (KA 1462/6-1).

References

  1. Rabah Amir. Stochastic games in economics and related fields: an overview. Stochastic Games and Applications, pages 455-470, 2003. Google Scholar
  2. Daniel Andersson and Peter Bro Miltersen. The complexity of solving stochastic games on graphs. In International Symposium on Algorithms and Computation, pages 112-121. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-10631-6_13.
  3. Muqsit Azeem, Alexandros Evangelidis, Jan Křetínskỳ, Alexander Slivinskiy, and Maximilian Weininger. Optimistic and topological value iteration for simple stochastic games. In International Symposium on Automated Technology for Verification and Analysis, pages 285-302. Springer, 2022. Google Scholar
  4. Christel Baier and Joost-Pieter Katoen. Principles of Model Checking. MIT press, 2008. Google Scholar
  5. Christel Baier, Joachim Klein, Linda Leuschner, David Parker, and Sascha Wunderlich. Ensuring the reliability of your model checker: Interval iteration for Markov decision processes. In International Conference on Computer Aided Verification, volume 10426, pages 160-180. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-63387-9_8.
  6. Raphaël Berthon, Joost-Pieter Katoen, and Zihan Zhou. A direct reduction from stochastic parity games to simple stochastic games, 2025. URL: https://arxiv.org/abs/2506.06223.
  7. Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. Arena-independent finite-memory determinacy in stochastic games. Log. Methods Comput. Sci., 19(4), 2023. URL: https://doi.org/10.46298/LMCS-19(4:18)2023.
  8. Cristian S Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan. Deciding parity games in quasipolynomial time. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 252-263, 2017. URL: https://doi.org/10.1145/3055399.3055409.
  9. Krishnendu Chatterjee and Nathanaël Fijalkow. A reduction from parity games to simple stochastic games. Electronic Proceedings in Theoretical Computer Science, 54:74-86, 2011. URL: https://doi.org/10.4204/eptcs.54.6.
  10. Krishnendu Chatterjee and Thomas A Henzinger. Strategy improvement and randomized subexponential algorithms for stochastic parity games. In Annual Symposium on Theoretical Aspects of Computer Science, pages 512-523. Springer, 2006. URL: https://doi.org/10.1007/11672142_42.
  11. Krishnendu Chatterjee and Thomas A Henzinger. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters, 106(1):1-7, 2008. URL: https://doi.org/10.1016/J.IPL.2007.08.035.
  12. Krishnendu Chatterjee, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A solver for probabilistic games. In Computer Aided Verification: 22nd International Conference, volume 6174, pages 665-669. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-14295-6_57.
  13. Krishnendu Chatterjee, Marcin Jurdziński, and Thomas A. Henzinger. Simple stochastic parity games. In Matthias Baaz and Johann A. Makowsky, editors, Computer Science Logic, volume 2803, pages 100-113, Berlin, Heidelberg, 2003. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/978-3-540-45220-1_11.
  14. Krishnendu Chatterjee, Marcin Jurdzinski, and Thomas A Henzinger. Quantitative stochastic parity games. In SODA, volume 4, pages 121-130, 2004. URL: http://dl.acm.org/citation.cfm?id=982792.982808.
  15. Krishnendu Chatterjee, Rupak Majumdar, and Marcin Jurdzinski. On Nash equilibria in stochastic games. In Computer Science Logic, volume 3210 of Lecture Notes in Computer Science, pages 26-40. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-30124-0_6.
  16. Krishnendu Chatterjee and Nir Piterman. Combinations of qualitative winning for stochastic parity games. In 30th International Conference on Concurrency Theory, volume 140 of LIPIcs, pages 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.CONCUR.2019.6.
  17. Anne Condon. On algorithms for simple stochastic games. Advances in Computational Complexity Theory, 13:51-72, 1990. URL: https://doi.org/10.1090/DIMACS/013/04.
  18. Anne Condon. The complexity of stochastic games. Information and Computation, 96(2):203-224, 1992. URL: https://doi.org/10.1016/0890-5401(92)90048-K.
  19. Wojciech Czerwiński, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdziński, Ranko Lazić, and Paweł Parys. Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2333-2349. SIAM, 2019. Google Scholar
  20. Matthew Darlington, Kevin D. Glazebrook, David S. Leslie, Rob Shone, and Roberto Szechtman. A stochastic game framework for patrolling a border. Eur. J. Oper. Res., 311(3):1146-1158, 2023. URL: https://doi.org/10.1016/J.EJOR.2023.06.011.
  21. Julia Eisentraut, Edon Kelmendi, Jan Křetínskỳ, and Maximilian Weininger. Value iteration for simple stochastic games: Stopping criterion and learning algorithm. Information and Computation, 285:104886, 2022. URL: https://doi.org/10.1016/J.IC.2022.104886.
  22. Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, and Mihalis Yannakakis. Multi-objective model checking of Markov decision processes. Log. Methods Comput. Sci., 4(4), 2008. URL: https://doi.org/10.2168/LMCS-4(4:8)2008.
  23. Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, and Dominik Wojtczak. Model-free reinforcement learning for stochastic parity games. In 31st International Conference on Concurrency Theory, volume 171 of LIPIcs, pages 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.CONCUR.2020.21.
  24. Arnd Hartmanns and Benjamin Lucien Kaminski. Optimistic value iteration. In Computer Aided Verification - 32nd International Conference, volume 12225 of Lecture Notes in Computer Science, pages 488-511. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-53291-8_26.
  25. Christian Hensel, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann, and Matthias Volk. The probabilistic model checker storm. International Journal on Software Tools for Technology Transfer, pages 1-22, 2021. Google Scholar
  26. Marcin Jurdziński. Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters, 68(3):119-124, 1998. Google Scholar
  27. Marcin Jurdziński and Ranko Lazić. Succinct progress measures for solving parity games. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-9. IEEE, 2017. Google Scholar
  28. Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman, and David Parker. A game-based abstraction-refinement framework for Markov decision processes. Formal Methods in System Design, 36:246-280, 2010. URL: https://doi.org/10.1007/S10703-010-0097-6.
  29. Jan Křetínskỳ, Emanuel Ramneantu, Alexander Slivinskiy, and Maximilian Weininger. Comparison of algorithms for simple stochastic games. Information and Computation, 289:104885, 2022. URL: https://doi.org/10.1016/J.IC.2022.104885.
  30. Marta Kwiatkowska, Gethin Norman, David Parker, and Gabriel Santos. PRISM-games 3.0: Stochastic game verification with concurrency, equilibria and time. In Computer Aided Verification - 32nd International Conference, volume 12225 of Lecture Notes in Computer Science, pages 475-487. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-53291-8_25.
  31. Marta Z. Kwiatkowska, Gethin Norman, and David Parker. PRISM 4.0: Verification of probabilistic real-time systems. In Computer Aided Verification - 23rd International Conference, volume 6806 of Lecture Notes in Computer Science, pages 585-591. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-22110-1_47.
  32. Karoliina Lehtinen. A modal μ perspective on solving parity games in quasi-polynomial time. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, pages 639-648, 2018. URL: https://doi.org/10.1145/3209108.3209115.
  33. David S Leslie, Steven Perkins, and Zibo Xu. Best-response dynamics in zero-sum stochastic games. Journal of Economic Theory, 189:105095, 2020. URL: https://doi.org/10.1016/J.JET.2020.105095.
  34. Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. Symbolic control for stochastic systems via finite parity games. Nonlinear Analysis: Hybrid Systems, 51:101430, 2024. URL: https://doi.org/10.1016/j.nahs.2023.101430.
  35. Donald A Martin. The determinacy of Blackwell games. The Journal of Symbolic Logic, 63(4):1565-1581, 1998. URL: https://doi.org/10.2307/2586667.
  36. Pawel Parys. Parity games: Zielonka’s algorithm in quasi-polynomial time. In 44th International Symposium on Mathematical Foundations of Computer Science, volume 138 of LIPIcs, pages 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.MFCS.2019.10.
  37. Kittiphon Phalakarn, Toru Takisaka, Thomas Haas, and Ichiro Hasuo. Widest paths and global propagation in bounded value iteration for stochastic games. In Computer Aided Verification: 32nd International Conference, pages 349-371. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-53291-8_19.
  38. Martin L Puterman. Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons, 2014. Google Scholar
  39. Tim Quatmann and Joost-Pieter Katoen. Sound value iteration. In Computer Aided Verification - 30th International Conference, volume 10981 of Lecture Notes in Computer Science, pages 643-661. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-96145-3_37.
  40. Lloyd S Shapley. Stochastic games. Proceedings of the National Academy of Sciences, 39(10):1095-1100, 1953. Google Scholar
  41. Frédéric Simard, Josée Desharnais, and François Laviolette. General cops and robbers games with randomness. Theor. Comput. Sci., 887:30-50, 2021. URL: https://doi.org/10.1016/J.TCS.2021.06.043.
  42. Michael Ummels and Dominik Wojtczak. The complexity of Nash equilibria in stochastic multiplayer games. Log. Methods Comput. Sci., 7(3), 2011. URL: https://doi.org/10.2168/LMCS-7(3:20)2011.
  43. Uri Zwick and Mike Paterson. The complexity of mean payoff games on graphs. Theoretical Computer Science, 158(1-2):343-359, 1996. URL: https://doi.org/10.1016/0304-3975(95)00188-3.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact