{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:37:39Z","timestamp":1743140259483,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562211"},{"type":"electronic","value":"9783031562228"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56222-8_13","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T08:02:30Z","timestamp":1710835350000},"page":"225-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Memoryless Strategies in\u00a0Stochastic Reachability Games"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kiefer","sequence":"first","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]},{"given":"Mahsa","family":"Shirmohammadi","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Totzke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: Annual Symposium on Foundations of Computer Science (FOCS), pp. 564\u2013575. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743507","DOI":"10.1109\/SFCS.1998.743507"},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/3107926","volume":"64","author":"N Bertrand","year":"2017","unstructured":"Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. J. ACM 64(5), 33:1-33:48 (2017). https:\/\/doi.org\/10.1145\/3107926","journal-title":"J. ACM"},{"key":"13_CR3","unstructured":"Billingsley, P.: Probability and Measure, Third Edition. Wiley, New York (1995)"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bordais, B., Bouyer, P., Le Roux, S.: Optimal strategies in concurrent reachability games. In: Computer Science Logic (CSL). LIPIcs, vol. 216, pp. 7:1\u20137:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2022.7","DOI":"10.4230\/LIPIcs.CSL.2022.7"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Markey, N., Randour, M., Sangnier, A., Stan, D.: Reachability in networks of register protocols under stochastic schedulers. In: International Colloquium on Automata, Languages and Programming (ICALP), vol. 55, pp. 106:1\u2013106:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.106","DOI":"10.4230\/LIPIcs.ICALP.2016.106"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-36742-7_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Chen","year":"2013","unstructured":"Chen, T., Forejt, V., Kwiatkowska, M., Parker, D., Simaitis, A.: PRISM-games: a model checker for stochastic multi-player games. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 185\u2013191. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_13"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90048-K","journal-title":"Inf. Comput."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L De Alfaro","year":"2007","unstructured":"De Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theor. Comput. Sci. 386(3), 188\u2013217 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.07.008","journal-title":"Theor. Comput. Sci."},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Everett, H.: Recursive games. In: Contributions to the Theory of Games, Volume III, Annals of Mathematics Studies, vol. 39, pp. 47\u201378. Princeton University Press, Princeton (1957). https:\/\/doi.org\/10.1515\/9781400882151-004","DOI":"10.1515\/9781400882151-004"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00245-018-9536-3","volume":"82","author":"J Flesch","year":"2020","unstructured":"Flesch, J., Predtetchinski, A., Sudderth, W.: Positive zero-sum stochastic games with countable state and action spaces. Appl. Math. Optim. 82, 499\u2013516 (2020). https:\/\/doi.org\/10.1007\/s00245-018-9536-3","journal-title":"Appl. Math. Optim."},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Gillette, D.: Stochastic games with zero stop probabilities. In: Contributions to the Theory of Games (AM-39), Volume III, pp. 179\u2013188. Princeton University Press (1958). https:\/\/doi.org\/10.1515\/9781400882151-011","DOI":"10.1515\/9781400882151-011"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Gimbert, H., Horn, F.: Solving simple stochastic tail games. In: Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 847\u2013862 (2010). https:\/\/doi.org\/10.1137\/1.9781611973075","DOI":"10.1137\/1.9781611973075"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kiefer, S., Mayr, R., Shirmohammadi, M., Totzke, P.: Strategy complexity of reachability in countable stochastic 2-player games. Dynamic Games and Applications. arXiv:2203.12024 (2023)","DOI":"10.1007\/s13235-024-00575-6"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Kiefer, S., Mayr, R., Shirmohammadi, M., Wojtczak, D.: On strong determinacy of countable stochastic games. In: ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201312. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005134","DOI":"10.1109\/LICS.2017.8005134"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Kiefer, S., Mayr, R., Shirmohammadi, M., Wojtczak, D.: Parity objectives in countable MDPs. In: ACM\/IEEE Symposium on Logic in Computer Science (LICS) (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005100","DOI":"10.1109\/LICS.2017.8005100"},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/0319039","volume":"19","author":"PR Kumar","year":"1981","unstructured":"Kumar, P.R., Shiau, T.H.: Existence of value and randomized strategies in zero-sum discrete-time stochastic dynamic games. SIAM J. Control. Optim. 19(5), 617\u2013634 (1981). https:\/\/doi.org\/10.1137\/0319039","journal-title":"SIAM J. Control. Optim."},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Ku\u010dera, A.: Turn-based stochastic games. In: Apt, K.R., Gr\u00e4del, E. (eds.) Lectures in Game Theory for Computer Scientists, pp. 146\u2013184. Cambridge University Press (2011). https:\/\/doi.org\/10.1017\/CBO9780511973468.006","DOI":"10.1017\/CBO9780511973468.006"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s001820050071","volume":"27","author":"A Maitra","year":"1998","unstructured":"Maitra, A., Sudderth, W.: Finitely additive stochastic games with Borel measurable payoffs. Internat. J. Game Theory 27(2), 257\u2013267 (1998). https:\/\/doi.org\/10.1007\/s001820050071","journal-title":"Internat. J. Game Theory"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Nowak, A., Raghavan, T.: Positive stochastic games and a theorem of Ornstein. In: Raghavan, T.E.S., Ferguson, T.S., Parthasarathy, T., Vrieze, O.J. (eds.) Stochastic Games And Related Topics. Theory and Decision Library, vol. 7. Springer, Dordrecht (1991). https:\/\/doi.org\/10.1007\/978-94-011-3760-7_11","DOI":"10.1007\/978-94-011-3760-7_11"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"563","DOI":"10.2307\/2035700","volume":"20","author":"D Ornstein","year":"1969","unstructured":"Ornstein, D.: On the existence of stationary optimal strategies. Proc. Am. Math. Soc. 20(2), 563\u2013569 (1969). https:\/\/doi.org\/10.2307\/2035700","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1287\/moor.22.2.494","volume":"22","author":"P Secchi","year":"1997","unstructured":"Secchi, P.: Stationary strategies for recursive games. Math. Oper. Res. 22(2), 494\u2013512 (1997). https:\/\/doi.org\/10.1287\/moor.22.2.494","journal-title":"Math. Oper. Res."},{"issue":"10","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"LS Shapley","year":"1953","unstructured":"Shapley, L.S.: Stochastic games. Proc. Natl. Acad. Sci. 39(10), 1095\u20131100 (1953). https:\/\/doi.org\/10.1073\/pnas.39.10.1095","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Taming the Infinities of Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56222-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T22:03:20Z","timestamp":1730930600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56222-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562211","9783031562228"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56222-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}