Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Strategy Complexity of Büchi Objectives in Concurrent Stochastic Games (2404.15483v1)

Published 23 Apr 2024 in cs.GT and math.PR

Abstract: We study 2-player concurrent stochastic B\"uchi games on countable graphs. Two players, Max and Min, seek respectively to maximize and minimize the probability of visiting a set of target states infinitely often. We show that there always exist $\varepsilon$-optimal Max strategies that use just a step counter plus 1 bit of public memory. This upper bound holds for all countable graphs, but it is a new result even for the special case of finite graphs. The upper bound is tight in the sense that Max strategies that use just a step counter, or just finite memory, are not sufficient even on finite game graphs. The upper bound is a consequence of a slightly stronger new result: $\varepsilon$-optimal Max strategies for the combined B\"uchi and Transience objective require just 1 bit of public memory (but cannot be memoryless). Our proof techniques also yield a closely related result, that $\varepsilon$-optimal Max strategies for the Transience objective alone (which is only meaningful in infinite graphs) can be memoryless.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Constrained stochastic games in wireless networks. In IEEE global communications conference (GLOBECOM), IEEE (Ed.). Washington.
  2. Zero-sum constrained stochastic games with independent state processes. Math. Methods Oper. Res. 62, 3 (2005), 375–386. https://doi.org/10.1007/s00186-005-0034-4
  3. Michael Bacharach. 2019. Economics and the Theory of Games. CRC Press.
  4. Patrick Billingsley. 1995. Probability and Measure. Wiley, New York, NY. Third edition.
  5. Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 250), Anuj Dawar and Venkatesan Guruswami (Eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 33:1–33:18. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.33
  6. Optimal Strategies in Concurrent Reachability Games. In 30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference) (LIPIcs, Vol. 216), Florin Manea and Alex Simpson (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7:1–7:17. https://doi.org/10.4230/LIPIcs.CSL.2022.7
  7. Reachability in Networks of Register Protocols under Stochastic Schedulers. In International Colloquium on Automata, Languages and Programming (ICALP) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 55). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 106:1–106:14.
  8. Luca de Alfaro and Thomas Henzinger. 2000. Concurrent Omega-Regular Games. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000). IEEE.
  9. L. de Alfaro and T. A. Henzinger. 2001. Interface automata. In International Symposium on Foundations of Software Engineering. ACM, 109–120. https://doi.org/10.1145/503209
  10. Concurrent Reachability Games. In 39th Annual Symposium on Foundations of Computer Science, FOCS ’98, November 8-11, 1998, Palo Alto, California, USA. IEEE Computer Society, 564–575. https://doi.org/10.1109/SFCS.1998.743507
  11. Positive zero-sum stochastic games with countable state and action spaces. Applied Mathematics and Optimization 82 (2020), 499–516. Issue 2.
  12. D. Gillette. 1958. Stochastic Games with Zero Stop Probabilities. In Contributions to the Theory of Games (AM-39), Volume III. Princeton University Press, 179–188. https://doi.org/10.1515/9781400882151-011
  13. A. Jaskiewicz and A. S. Nowak. 2011. Stochastic Games with Unbounded Payoffs: Applications to Robust Control in Economics. Dynamic Games and Applications 1, 2 (2011), 253–279. https://doi.org/10.1007/s13235-011-0013-8
  14. Büchi Objectives in Countable MDPs. In International Colloquium on Automata, Languages and Programming (ICALP) (LIPIcs, Vol. 132). 119:1–119:14. https://doi.org/10.4230/LIPIcs.ICALP.2019.119 Full version at https://arxiv.org/abs/1904.11573.
  15. Strategy Complexity of Parity Objectives in Countable MDPs. In International Conference on Concurrency Theory (CONCUR). 7:1–:17. https://doi.org/10.4230/LIPIcs.CONCUR.2020.39
  16. Transience in Countable MDPs. In International Conference on Concurrency Theory (CONCUR) (LIPIcs, Vol. 203). Full version at https://arxiv.org/abs/2012.13739.
  17. Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. Dynamic Games and Applications (2024). To appear, https://arxiv.org/abs/2203.12024.
  18. P. R. Kumar and T. H. Shiau. 1981. Existence of Value and Randomized Strategies in Zero-Sum Discrete-Time Stochastic Dynamic Games. SIAM Journal on Control and Optimization 19, 5 (1981), 617–634. https://doi.org/10.1137/0319039
  19. A. Maitra and W. Sudderth. 1998. Finitely Additive Stochastic Games with Borel Measurable Payoffs. International Journal of Game Theory 27, 2 (July 1998), 257–267. https://doi.org/10.1007/s001820050071
  20. Ashok P. Maitra and William D. Sudderth. 1996. Discrete Gambling and Stochastic Games. Springer-Verlag.
  21. Donald A. Martin. 1998. The determinacy of Blackwell games. Journal of Symbolic Logic 63, 4 (1998), 1565–1581. https://doi.org/10.2307/2586667
  22. J. Neveu. 1975. Discrete-Parameter Martingales. North-Holland Publishing Company.
  23. Abraham Neyman and Sylvain Sorin. 2003. Stochastic Games and Applications. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0189-2
  24. A. Nowak and Krzysztof Szajowski. 2005. Advances in Dynamic Games: Applications to Economics, Finance, Optimization, and Stochastic Control. Birkhaeuser, Boston. https://doi.org/10.1007/b138903
  25. Donald Ornstein. 1969. On the Existence of Stationary Optimal Strategies. Proc. Amer. Math. Soc. 20, 2 (1969), 563–569. https://doi.org/10.2307/2035700
  26. Stochastic Games and Related Topics: in honor of Professor LS Shapley. Vol. 7. Springer Science & Business Media. https://doi.org/10.1007/978-94-011-3760-7
  27. Piercesare Secchi. 1998. On the existence of good stationary strategies for nonleavable stochastic games. International Journal of Game Theory 27 (1998), 61–81. Issue 1. https://doi.org/10.1007/BF01243195
  28. Lloyd S Shapley. 1953. Stochastic games. Proceedings of the National Academy of Sciences 39, 10 (1953), 1095–1100. https://doi.org/10.1073/pnas.39.10.1095
  29. Eilon Solan and Nicolas Vieille. 2015. Stochastic games. Proceedings of the National Academy of Sciences 112, 45 (2015), 13743–13746. https://doi.org/10.1073/pnas.1513508112 arXiv:https://www.pnas.org/content/112/45/13743.full.pdf
  30. Sylvain Sorin. 1992. Repeated games with complete information. In Handbook of Game Theory with Economic Applications, R.J. Aumann and S. Hart (Eds.). Handbook of Game Theory with Economic Applications, Vol. 1. Elsevier, Chapter 4, 71–107. https://ideas.repec.org/h/eee/gamchp/1-04.html
  31. Mária Svoreňová and Marta Kwiatkowska. 2016. Quantitative verification and strategy synthesis for stochastic games. European Journal of Control 30 (2016), 15–30.
  32. F. Thuijsman. 1992. Optimality and Equilibria in Stochastic Games. Number no. 82 in CWI Tract - Centrum voor Wiskunde en Informatica. Centrum voor Wiskunde en Informatica. https://books.google.co.uk/books?id=sfzuAAAAMAAJ

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets