{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:31:28Z","timestamp":1757313088603,"version":"3.41.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:00:00Z","timestamp":1726272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:00:00Z","timestamp":1726272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["IES\\R3\\213110"],"award-info":[{"award-number":["IES\\R3\\213110"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V025848\/1"],"award-info":[{"award-number":["EP\/V025848\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\varepsilon $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>-optimal (resp. optimal) strategies. These results depend on the size of the players\u2019 action sets and on whether one requires strategies that are uniform (i.e., independent of the start state). Our main result is that <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\varepsilon $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>-optimal (resp. optimal) Maximizer strategies requires infinite memory if Minimizer is allowed infinite action sets. This lower bound holds even under very strong restrictions. Even in the special case of infinitely branching turn-based reachability games, even if all states allow an almost surely winning Maximizer strategy, strategies with a step counter plus finite private memory are still useless. Regarding <jats:italic>uniformity<\/jats:italic>, we show that for Maximizer there need not exist memoryless (i.e., positional) uniformly <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\varepsilon $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>-optimal strategies even in the special case of finite action sets or in finitely branching turn-based games. On the other hand, in games with finite action sets, there always exists a uniformly <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\varepsilon $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>-optimal Maximizer strategy that uses just one bit of public memory.<\/jats:p>","DOI":"10.1007\/s13235-024-00575-6","type":"journal-article","created":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T11:01:51Z","timestamp":1726311711000},"page":"980-1036","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Strategy Complexity of Reachability in Countable Stochastic 2-Player Games"],"prefix":"10.1007","volume":"15","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,9,14]]},"reference":[{"issue":"3","key":"575_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00186-005-0034-4","volume":"62","author":"E Altman","year":"2005","unstructured":"Altman E, Avrachenkov K, Marquez R, Miller GB (2005) Zero-sum constrained stochastic games with independent state processes. Math Methods Oper Res 62(3):375\u2013386. https:\/\/doi.org\/10.1007\/s00186-005-0034-4","journal-title":"Math Methods Oper Res"},{"key":"575_CR2","doi-asserted-by":"crossref","unstructured":"Altman E, Avrachenkov K, Bonneau N et\u00a0al (2007) Constrained stochastic games in wireless networks. In: IEEE (ed) IEEE global communications conference (GLOBECOM), Washington","DOI":"10.1109\/GLOCOM.2007.66"},{"key":"575_CR3","unstructured":"Aumann RJ (1981) Survey of repeated games. Essays in game theory and mathematical economics in honor of Oskar Morgenstern"},{"key":"575_CR4","doi-asserted-by":"crossref","unstructured":"Bacharach M (2019) Economics and the theory of games. CRC Press","DOI":"10.1201\/9780429051739"},{"key":"575_CR5","doi-asserted-by":"crossref","unstructured":"Bertrand N, Genest B, Gimbert H (2017) Qualitative determinacy and decidability of stochastic games with signals. J ACM 64(5):33:1-33:48","DOI":"10.1145\/3107926"},{"key":"575_CR6","volume-title":"Probability and measure","author":"P Billingsley","year":"1995","unstructured":"Billingsley P (1995) Probability and measure, 3rd edn. Wiley, New York, NY","edition":"3"},{"issue":"1","key":"575_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1214\/aoms\/1177698513","volume":"39","author":"D Blackwell","year":"1968","unstructured":"Blackwell D, Ferguson TS (1968) The big match. Ann Math. Stat 39(1):159\u2013163. https:\/\/doi.org\/10.1214\/aoms\/1177698513","journal-title":"Stat"},{"key":"575_CR8","doi-asserted-by":"publisher","unstructured":"Bordais B, Bouyer P, Le Roux S (2022) Optimal strategies in concurrent reachability games. Computer science logic (CSL), LIPIcs, vol 216. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, pp 7:1\u20137:17.https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2022.7","DOI":"10.4230\/LIPIcs.CSL.2022.7"},{"key":"575_CR9","unstructured":"Bouyer P, Markey N, Randour M et\u00a0al (2016) 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\u00a055. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp 106:1\u2013106:14"},{"key":"575_CR10","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1016\/j.ic.2011.02.002","volume":"209","author":"T Br\u00e1zdil","year":"2011","unstructured":"Br\u00e1zdil T, Bro\u017eek V, Ku\u010dera A, Obdrz\u00e1lek J (2011) Qualitative reachability in stochastic BPA games. Inf Comput 209:1160\u20131183. https:\/\/doi.org\/10.1016\/j.ic.2011.02.002","journal-title":"Inf Comput"},{"key":"575_CR11","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil T, Kiefer S, Ku\u010dera A et\u00a0al (2014) Zero-reachability in probabilistic multi-counter automata. In: ACM\/IEEE symposium on logic in computer science (LICS). Association for Computing Machinery, New York, NY, USA, CSL-LICS \u201914","DOI":"10.1145\/2603088.2603161"},{"key":"575_CR12","volume-title":"An introduction to the theory of infinite series","author":"T Bromwich","year":"1955","unstructured":"Bromwich T (1955) An introduction to the theory of infinite series. McMillan and Company, London"},{"key":"575_CR13","doi-asserted-by":"crossref","unstructured":"Chen T, Forejt V, Kwiatkowska M et\u00a0al (2013) Prism-games: a model checker for stochastic multi-player games. In: International conference on TOOLS and algorithms for the construction and analysis of systems. Springer, pp 185\u2013191","DOI":"10.1007\/978-3-642-36742-7_13"},{"issue":"2","key":"575_CR14","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 (1992) The complexity of stochastic games. Inf Comput 96(2):203\u2013224. https:\/\/doi.org\/10.1016\/0890-5401(92)90048-K","journal-title":"Inf Comput"},{"key":"575_CR15","doi-asserted-by":"publisher","unstructured":"de\u00a0Alfaro L, Henzinger TA (2001) Interface automata. In: International symposium on foundations of software engineering. ACM, pp 109\u2013120. https:\/\/doi.org\/10.1145\/503209","DOI":"10.1145\/503209"},{"key":"575_CR16","doi-asserted-by":"publisher","unstructured":"de\u00a0Alfaro L, Henzinger TA, Kupferman O (1998) Concurrent reachability games. In: 39th annual symposium on foundations of computer science, FOCS \u201998, November 8\u201311, 1998, Palo Alto, California, USA. IEEE Computer Society, pp 564\u2013575. https:\/\/doi.org\/10.1109\/SFCS.1998.743507","DOI":"10.1109\/SFCS.1998.743507"},{"key":"575_CR17","doi-asserted-by":"crossref","unstructured":"Everett H (1957) Recursive games. Contributions to the theory of games, volume III, vol 39. Annals of mathematics studies. Princeton University Press, Princeton, NJ, pp 47\u201378","DOI":"10.1515\/9781400882151-004"},{"key":"575_CR18","volume-title":"Algorithms for solving some undiscounted stochastic games","author":"JA Filar","year":"1980","unstructured":"Filar JA (1980) Algorithms for solving some undiscounted stochastic games. University of Illinois at Chicago, Chicago"},{"issue":"4","key":"575_CR19","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF00935890","volume":"34","author":"JA Filar","year":"1981","unstructured":"Filar JA (1981) Ordered field property for stochastic games when the player who controls transitions changes from state to state. J Optim Theory Appl 34(4):503\u2013515. https:\/\/doi.org\/10.1007\/BF00935890","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"575_CR20","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1017\/jpr.2018.47","volume":"55","author":"J Flesch","year":"2018","unstructured":"Flesch J, Predtetchinski A, Sudderth WD (2018) Characterization and simplification of optimal strategies in positive stochastic games. J Appl Probab 55(3):728\u2013741","journal-title":"J Appl Probab"},{"key":"575_CR21","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 (2020) Positive zero-sum stochastic games with countable state and action spaces. Appl Math Optim 82:499\u2013516","journal-title":"Appl Math Optim"},{"issue":"4","key":"575_CR22","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/s13235-021-00378-z","volume":"11","author":"J Flesch","year":"2021","unstructured":"Flesch J, Herings PJ, Maes J, Predtetchinski A (2021) Subgame maxmin strategies in zero-sum stochastic games with tolerance levels. Dyn Games Appl 11(4):704\u2013737","journal-title":"Dyn Games Appl"},{"key":"575_CR23","doi-asserted-by":"crossref","unstructured":"Fristedt B, Lapic SK, Sudderth WD (1995) The big match on the integers. In: Olsder GJ (ed) New trends in dynamic games and applications. Annals of the international society of dynamic games. Birkh\u00e4user, Boston","DOI":"10.1007\/978-1-4612-4274-1_5"},{"key":"575_CR24","doi-asserted-by":"publisher","unstructured":"Gillette D (1958) Stochastic games with zero stop probabilities. In: Uygffg D (ed) Contributions to the theory of games (AM-39), vol III. Princeton University Press, Princeton, pp 179\u2013187. https:\/\/doi.org\/10.1515\/9781400882151-011","DOI":"10.1515\/9781400882151-011"},{"key":"575_CR25","doi-asserted-by":"publisher","unstructured":"Gimbert H, Horn F (2010) Solving simple stochastic tail games. In: Annual ACM-SIAM symposium on discrete algorithms, pp 847\u2013862. https:\/\/doi.org\/10.1137\/1.9781611973075","DOI":"10.1137\/1.9781611973075"},{"key":"575_CR26","doi-asserted-by":"publisher","unstructured":"Hansen K, Ibsen-Jensen R, Neyman A (2018) The big match with a clock and a bit of memory. Economics and computation (EC). Association for Computing Machinery, New York, NY, USA, pp 149\u2013150. https:\/\/doi.org\/10.1145\/3219166.3219198","DOI":"10.1145\/3219166.3219198"},{"issue":"2","key":"575_CR27","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s13235-011-0013-8","volume":"1","author":"A Jaskiewicz","year":"2011","unstructured":"Jaskiewicz A, Nowak AS (2011) Stochastic games with unbounded payoffs: applications to robust control in economics. Dyn Games Appl 1(2):253\u2013279. https:\/\/doi.org\/10.1007\/s13235-011-0013-8","journal-title":"Dyn Games Appl"},{"key":"575_CR28","doi-asserted-by":"publisher","unstructured":"Jech T (2002) Set theory: the third millennium edition, 3rd edn. Springer Monographs in Mathematics. https:\/\/doi.org\/10.1007\/3-540-44761-X","DOI":"10.1007\/3-540-44761-X"},{"key":"575_CR29","doi-asserted-by":"publisher","unstructured":"Kalai E (1990) Bounded rationality and strategic complexity in repeated games. In: Ichiishi T, Neyman A, Tauman Y (eds) Game theory and applications. Economic theory, econometrics, and mathematical economics. Academic Press, San Diego, pp 131\u2013157. https:\/\/doi.org\/10.1016\/B978-0-12-370182-4.50010-6","DOI":"10.1016\/B978-0-12-370182-4.50010-6"},{"key":"575_CR30","doi-asserted-by":"publisher","unstructured":"Kiefer S, Mayr R, Shirmohammadi M, Wojtczak D (2017a) On strong determinacy of countable stochastic games. In: ACM\/IEEE symposium on logic in computer science (LICS). IEEE Computer Society, pp 1\u201312. https:\/\/doi.org\/10.1109\/LICS.2017.8005134","DOI":"10.1109\/LICS.2017.8005134"},{"key":"575_CR31","doi-asserted-by":"publisher","unstructured":"Kiefer S, Mayr R, Shirmohammadi M, Wojtczak D (2017b) Parity objectives in countable MDPs. In: ACM\/IEEE symposium on logic in computer science (LICS), pp 1\u201311. https:\/\/doi.org\/10.1109\/LICS.2017.8005100","DOI":"10.1109\/LICS.2017.8005100"},{"key":"575_CR32","doi-asserted-by":"publisher","unstructured":"Kiefer S, Mayr R, Shirmohammadi M, Totzke P (2019) B\u00fcchi objectives in countable MDPs. In: International colloquium on automata, languages and programming (ICALP), pp 119:1\u2013119:14. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.119, full version at https:\/\/arxiv.org\/abs\/1904.11573","DOI":"10.4230\/LIPIcs.ICALP.2019.119"},{"key":"575_CR33","doi-asserted-by":"publisher","unstructured":"Kiefer S, Mayr R, Shirmohammadi M, Totzke P (2020a) Strategy complexity of parity objectives in countable MDPs. In: International conference on concurrency theory (CONCUR), pp 7:1\u20137:17. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.39","DOI":"10.4230\/LIPIcs.CONCUR.2020.39"},{"key":"575_CR34","doi-asserted-by":"publisher","unstructured":"Kiefer S, Mayr R, Shirmohammadi M, et\u00a0al (2020b) How to play in infinite MDPs (invited talk). In: International colloquium on automata, languages and programming (ICALP), pp 3:1\u20133:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.3","DOI":"10.4230\/LIPIcs.ICALP.2020.3"},{"issue":"5","key":"575_CR35","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/0319039","volume":"19","author":"PR Kumar","year":"1981","unstructured":"Kumar PR, Shiau TH (1981) Existence of value and randomized strategies in zero-sum discrete-time stochastic dynamic games. SIAM J Control Optim 19(5):617\u2013634. https:\/\/doi.org\/10.1137\/0319039","journal-title":"SIAM J Control Optim"},{"key":"575_CR36","doi-asserted-by":"publisher","unstructured":"Ku\u010dera A (2011) Turn-based stochastic games. In: Apt KR, Gr\u00e4del E (eds) Lectures in game theory for computer scientists. Cambridge University Press, pp 146\u2013184. https:\/\/doi.org\/10.1017\/CBO9780511973468.006","DOI":"10.1017\/CBO9780511973468.006"},{"issue":"2","key":"575_CR37","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s13235-012-0054-7","volume":"3","author":"R Laraki","year":"2013","unstructured":"Laraki R, Maitra AP, Sudderth WD (2013) Two-person zero-sum stochastic games with semicontinuous payoff. Dyn Games Appl 3(2):162\u2013171","journal-title":"Dyn Games Appl"},{"issue":"2","key":"575_CR38","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s001820050071","volume":"27","author":"A Maitra","year":"1998","unstructured":"Maitra A, Sudderth W (1998) Finitely additive stochastic games with Borel measurable payoffs. Int J Game Theory 27(2):257\u2013267. https:\/\/doi.org\/10.1007\/s001820050071","journal-title":"Int J Game Theory"},{"key":"575_CR39","doi-asserted-by":"crossref","unstructured":"Maitra AP, Sudderth WD (1996) Discrete gambling and stochastic games. Springer-Verlag","DOI":"10.1007\/978-1-4612-4002-0"},{"issue":"3","key":"575_CR40","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1287\/moor.1070.0264","volume":"32","author":"AP Maitra","year":"2007","unstructured":"Maitra AP, Sudderth WD (2007) Subgame-perfect equilibria for stochastic games. Math Oper Res 32(3):711\u2013722. https:\/\/doi.org\/10.1287\/moor.1070.0264","journal-title":"Math Oper Res"},{"issue":"4","key":"575_CR41","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"DA Martin","year":"1998","unstructured":"Martin DA (1998) The determinacy of blackwell games. J Symb Logic 63(4):1565\u20131581. https:\/\/doi.org\/10.2307\/2586667","journal-title":"J Symb Logic"},{"key":"575_CR42","unstructured":"Neveu J (1975) Discrete-parameter martingales. North-Holland Publishing Company"},{"key":"575_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-0189-2","author":"A Neyman","year":"2003","unstructured":"Neyman A, Sorin S (2003) Stochastic games and applications. Springer, Dordrech. https:\/\/doi.org\/10.1007\/978-94-010-0189-2","journal-title":"Springer, Dordrech."},{"key":"575_CR44","doi-asserted-by":"publisher","unstructured":"Nowak A, Raghavan T (1991) Positive stochastic games and a theorem of Ornstein. In: Raghavan T, Ferguson T, Parthasarathy T, Vrieze O (eds) Stochastic games and related topics, theory and decision library (Game theory, mathematical programming and operations research), vol 7. Springer. https:\/\/doi.org\/10.1007\/978-94-011-3760-7_11","DOI":"10.1007\/978-94-011-3760-7_11"},{"key":"575_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/b138903","author":"A Nowak","year":"2005","unstructured":"Nowak A, Szajowski K (2005) Advances in dynamic games: applications to economics, finance, optimization, and stochastic control. Birkhaeuser, Boston. https:\/\/doi.org\/10.1007\/b138903","journal-title":"Birkhaeuser, Boston."},{"issue":"2","key":"575_CR46","doi-asserted-by":"publisher","first-page":"563","DOI":"10.2307\/2035700","volume":"20","author":"D Ornstein","year":"1969","unstructured":"Ornstein D (1969) On the existence of stationary optimal strategies. Proc Am Math Soc 20(2):563\u2013569. https:\/\/doi.org\/10.2307\/2035700","journal-title":"Proc Am Math Soc"},{"key":"575_CR47","doi-asserted-by":"publisher","unstructured":"Puterman ML (1994) Markov decision processes: discrete stochastic dynamic programming, 1st edn. Wiley, New York, NY, USA. https:\/\/doi.org\/10.1002\/9780470316887","DOI":"10.1002\/9780470316887"},{"key":"575_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3760-7","author":"TES Raghavan","year":"2012","unstructured":"Raghavan TES, Ferguson T, Parthasarathy T, Vrieze O (2012) 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","journal-title":"Springer Science & Business Media."},{"issue":"2","key":"575_CR49","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1287\/moor.22.2.494","volume":"22","author":"P Secchi","year":"1997","unstructured":"Secchi P (1997) Stationary strategies for recursive games. Math Oper Res 22(2):494\u2013512. https:\/\/doi.org\/10.1287\/moor.22.2.494","journal-title":"Math Oper Res"},{"key":"575_CR50","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01243195","volume":"27","author":"P Secchi","year":"1998","unstructured":"Secchi P (1998) On the existence of good stationary strategies for nonleavable stochastic games. Int J Game Theory 27:61\u201381. https:\/\/doi.org\/10.1007\/BF01243195","journal-title":"Int J Game Theory"},{"issue":"10","key":"575_CR51","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"LS Shapley","year":"1953","unstructured":"Shapley LS (1953) Stochastic games. Proc Natl Acad Sci 39(10):1095\u2013110. https:\/\/doi.org\/10.1073\/pnas.39.10.1095","journal-title":"Stochastic games. Proc Natl Acad Sci"},{"issue":"45","key":"575_CR52","doi-asserted-by":"publisher","first-page":"13743","DOI":"10.1073\/pnas.1513508112","volume":"112","author":"E Solan","year":"2015","unstructured":"Solan E, Vieille N (2015) Stochastic games. Proc Natl Acad Sci 112(45):13743\u201313746. https:\/\/doi.org\/10.1073\/pnas.1513508112","journal-title":"Stochastic games. Proc Natl Acad Sci"},{"key":"575_CR53","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S1574-0005(05)80007-4","volume-title":"Handbook of game theory with economic applications, vol 1, chap 4","author":"S Sorin","year":"1992","unstructured":"Sorin S (1992) Repeated games with complete information. In: Aumann R, Hart S (eds) Handbook of game theory with economic applications, vol 1, chap 4. Elsevier, pp 71\u2013107"},{"key":"575_CR54","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejcon.2016.04.009","volume":"30","author":"M Svore\u0148ov\u00e1","year":"2016","unstructured":"Svore\u0148ov\u00e1 M, Kwiatkowska M (2016) Quantitative verification and strategy synthesis for stochastic games. Eur J Control 30:15\u201330","journal-title":"Eur J Control"},{"key":"575_CR55","unstructured":"Vrieze O (1987) Stochastic games with finite state and action spaces. CWI Tract - Centrum voor Wiskunde en Informatica, Centrum voor Wiskunde en Informatica"},{"issue":"1","key":"575_CR56","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01720283","volume":"5","author":"O Vrieze","year":"1983","unstructured":"Vrieze O, Tijs SH, Raghavan TES, Filar JA (1983) A finite algorithm for the switching control stochastic game. Oper Res Spektrum 5(1):15\u201324","journal-title":"Oper Res Spektrum"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-024-00575-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13235-024-00575-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-024-00575-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T05:04:59Z","timestamp":1751432699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13235-024-00575-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,14]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["575"],"URL":"https:\/\/doi.org\/10.1007\/s13235-024-00575-6","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2024,9,14]]},"assertion":[{"value":"6 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare they have no financial, or non-financial interests, and have no potential Conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"It is not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"It is not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"It is not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Publication"}}]}}