Document Open Access Logo

From Local to Global Optimality in Concurrent Parity Games

Authors Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux

PDF
Thumbnail PDF

File

LIPIcs.CSL.2024.18.pdf
  • Filesize: 0.95 MB
  • 21 pages

Document Identifiers

Author Details

Benjamin Bordais
  • Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF, 91190 Gif-sur-Yvette, France
  • TU Dortmund University, Germany
  • Center for Trustworthy Data Science and Security, University Alliance Ruhr, Germany
Patricia Bouyer
  • Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF, 91190 Gif-sur-Yvette, France
Stéphane Le Roux
  • Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF, 91190 Gif-sur-Yvette, France

Funding

This paper was partially funded by ANR-22-CE48-0012 (BisoUS).

Cite AsGet BibTex

Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. From Local to Global Optimality in Concurrent Parity Games. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 18:1-18:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.CSL.2024.18

Abstract

We study two-player games on finite graphs. Turn-based games have many nice properties, but concurrent games are harder to tame: e.g. turn-based stochastic parity games have positional optimal strategies, whereas even basic concurrent reachability games may fail to have optimal strategies. We study concurrent stochastic parity games, and identify a local structural condition that, when satisfied at each state, guarantees existence of positional optimal strategies for both players.

Subject Classification

ACM Subject Classification
  • Theory of computation → Solution concepts in game theory
Keywords
  • Game forms
  • stochastic games
  • parity games
  • Blackwell/Martin values

Metrics

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

Related Versions

References

  1. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. From local to global determinacy in concurrent graph games. In Mikolaj Bojanczyk and Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference, volume 213 of LIPIcs, pages 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2021.41.
  2. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Optimal strategies in concurrent reachability games. In Florin Manea and Alex Simpson, editors, 30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference), volume 216 of LIPIcs, pages 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.CSL.2022.7.
  3. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Playing (almost-)optimally in concurrent Büchi and co-Büchi games. In Anuj Dawar and Venkatesan Guruswami, editors, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India, volume 250 of LIPIcs, pages 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2022.33.
  4. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. From local to global optimality in concurrent parity games. CoRR, abs/2311.14373, 2023. URL: https://doi.org/10.48550/arXiv.2311.14373.
  5. Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Subgame optimal strategies in finite concurrent games with prefix-independent objectives. In Orna Kupferman and Pawel Sobocinski, editors, Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings, volume 13992 of Lecture Notes in Computer Science, pages 541-560. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-30829-1_26.
  6. Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. The complexity of quantitative concurrent parity games. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pages 678-687. ACM Press, 2006. URL: http://dl.acm.org/citation.cfm?id=1109557.1109631.
  7. Krishnendu Chatterjee, Marcin Jurdzinski, and Thomas A. Henzinger. Quantitative stochastic parity games. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 121-130. SIAM, 2004. URL: http://dl.acm.org/citation.cfm?id=982792.982808.
  8. Luca de Alfaro and Thomas A. Henzinger. Concurrent omega-regular games. In 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pages 141-154. IEEE Computer Society, 2000. URL: https://doi.org/10.1109/LICS.2000.855763.
  9. Luca de Alfaro and Rupak Majumdar. Quantitative solution of omega-regular games. Journal of Computer and System Sciences, 68:374-397, 2004. Google Scholar
  10. Hugh Everett. Recursive games. Annals of Mathematics Studies - Contributions to the Theory of Games, 3:67-78, 1957. Google Scholar
  11. Panganamala R Kumar and Tzong-Huei Shiau. Existence of value and randomized strategies in zero-sum discrete-time stochastic dynamic games. SIAM Journal on Control and Optimization, 19(5):617-634, 1981. Google Scholar
  12. Marta Kwiatkowska, Gethin Norman, David Parker, Gabriel Santos, and Rui Yan. Probabilistic model checking for strategic equilibria-based decision making. In Proc. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS'22), LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.MFCS.2022.4.
  13. Donald A. Martin. The determinacy of blackwell games. The Journal of Symbolic Logic, 63(4):1565-1581, 1998. Google Scholar
  14. John von Neumann and Oskar Morgenstern. Theory of Games and Economic Behavior. Princeton Univ. Press, Princeton, 1944. Google Scholar
  15. Wieslaw Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200(1-2):135-183, 1998. Google Scholar
  16. Wiesław Zielonka. Perfect-information stochastic parity games. In Proc. 7th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'04), volume 2987 of Lecture Notes in Computer Science, pages 499-513. Springer, 2004. Google Scholar
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-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact