{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T02:46:00Z","timestamp":1782873960441,"version":"3.54.5"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227515","type":"print"},{"value":"9783032227522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":105,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22752-2_26","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:52:30Z","timestamp":1776289950000},"page":"505-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Verification of Concurrent Stochastic Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6481-0754","authenticated-orcid":false,"given":"Angel Y.","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4137-8862","authenticated-orcid":false,"given":"David","family":"Parker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,16]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Aghassi, M., Bertsimas, D.: Robust game theory. Mathematical programming 107(1), 231\u2013273 (2006)","DOI":"10.1007\/s10107-005-0686-0"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Avis, D., Rosenberg, G.D., Savani, R., Von\u00a0Stengel, B.: Enumeration of nash equilibria for two-player games. Economic theory 42(1), 9\u201337 (2010)","DOI":"10.1007\/s00199-009-0449-x"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Badings, T., Simao, T.D., Suilen, M., Jansen, N.: Decision-making under uncertainty: beyond probabilities: Challenges and perspectives. International Journal on Software Tools for Technology Transfer 25(3), 375\u2013391 (2023)","DOI":"10.1007\/s10009-023-00704-3"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Bellman, R.: Dynamic programming. science 153(3731), 34\u201337 (1966)","DOI":"10.1126\/science.153.3731.34"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Berthon, R., Katoen, J.P., Mittelmann, M., Murano, A.: Robust strategies for stochastic multi-agent systems. In: Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems. p. 2437\u20132439. AAMAS \u201925, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2025)","DOI":"10.65109\/FPDC2745"},{"key":"26_CR6","unstructured":"Bouyer, P., Markey, N., Stan, D.: Mixed nash equilibria in concurrent terminal-reward games. In: FSTTCS 2014 (2014)"},{"key":"26_CR7","unstructured":"Bovy, E.M., Suilen, M., Junges, S., Jansen, N.: Imprecise probabilities meet partial observability: Game semantics for robust POMDPs. In: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24. pp. 6697\u20136706 (8 2024), main Track"},{"key":"26_CR8","unstructured":"Castro, P.F., D\u2019Argenio, P.: Polytopal stochastic games. In: Principles of Verification: Cycling the Probabilistic Landscape: Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, pp. 99\u2013\u2013117. Springer (2024)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., De\u00a0Alfaro, L., Henzinger, T.A.: Strategy improvement for concurrent reachability and turn-based stochastic safety games. Journal of computer and system sciences 79(5), 640\u2013657 (2013)","DOI":"10.1016\/j.jcss.2012.12.001"},{"key":"26_CR10","unstructured":"Chatterjee, K., Goharshady, E.K., Karrabi, M., Novotn\u00fd, P., \u017dikeli\u0107, u.: Solving long-run average reward robust MDPs via stochastic games. In: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI \u201924 (2024)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A.: A survey of stochastic $$\\omega $$-regular games. Journal of Computer and System Sciences 78(2), 394\u2013413 (2012)","DOI":"10.1016\/j.jcss.2011.05.002"},{"key":"26_CR12","unstructured":"Chatterjee, K., Sen, K., Henzinger, T.A.: Model-checking $$\\omega $$-regular properties of interval Markov chains. In: International Conference on Foundations of Software Science and Computational Structures. pp. 302\u2013317. Springer (2008)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Chen, T., Forejt, V., Kwiatkowska, M., Parker, D., Simaitis, A.: Automatic verification of competitive stochastic systems. Formal Methods in System Design 43, 61\u201392 (2013)","DOI":"10.1007\/s10703-013-0183-7"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Chen, T., Han, T., Kwiatkowska, M.: On the complexity of model checking interval-valued discrete time Markov chains. Information Processing Letters 113(7), 210\u2013216 (2013)","DOI":"10.1016\/j.ipl.2013.01.004"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Condon, A.: The complexity of stochastic games. Information and Computation 96(2), 203\u2013224 (1992)","DOI":"10.1016\/0890-5401(92)90048-K"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Programming of interdependent activities: Ii mathematical model. Econometrica, Journal of the Econometric Society pp. 200\u2013211 (1949)","DOI":"10.2307\/1905523"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"De\u00a0Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theoretical computer science 386(3), 188\u2013217 (2007)","DOI":"10.1016\/j.tcs.2007.07.008"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"De\u00a0Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing. pp. 675\u2013683 (2001)","DOI":"10.1145\/380752.380871"},{"key":"26_CR19","unstructured":"Farhat, Z.U., Ghosh, D., Atia, G.K., Wang, Y.: Online robust multi-agent reinforcement learning under model uncertainties (2025), https:\/\/arxiv.org\/abs\/2508.02948"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Fearnley, J., Savani, R.: The complexity of the simplex method. In: Proceedings of the forty-seventh annual ACM symposium on Theory of computing. pp. 201\u2013208 (2015)","DOI":"10.1145\/2746539.2746558"},{"key":"26_CR21","unstructured":"Filar, J., Vrieze, K.: Competitive Markov decision processes. Springer Science & Business Media (2012)"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Givan, R., Leach, S., Dean, T.: Bounded-parameter Markov decision processes. Artificial Intelligence 122(1-2), 71\u2013109 (2000)","DOI":"10.1016\/S0004-3702(00)00047-3"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Hansen, K.A., Ibsen-Jensen, R., Miltersen, P.B.: The complexity of solving reachability games using value and strategy iteration. In: International Computer Science Symposium in Russia. pp. 77\u201390. Springer (2011)","DOI":"10.1007\/978-3-642-20712-9_7"},{"key":"26_CR24","unstructured":"He, A.Y., Parker, D.: Robust verification of concurrent stochastic games under interval uncertainty. Extended Version (2026), https:\/\/arxiv.org\/abs\/2601.12003, extended version of the TACAS 2026 paper"},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"He, A.Y., Parker, D.: Artifact for \"Robust verification of concurrent stochastic games\" (2026). https:\/\/doi.org\/10.5281\/zenodo.18189280","DOI":"10.5281\/zenodo.18189280"},{"key":"26_CR26","unstructured":"Ho, C.P., Petrik, M., Wiesemann, W.: Fast bellman updates for robust MDPs. In: International Conference on Machine Learning. pp. 1979\u20131988. PMLR (2018)"},{"key":"26_CR27","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. John Wiley & Sons, New York (1960)"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Iyengar, G.N.: Robust dynamic programming. Mathematics of Operations Research 30(2), 257\u2013280 (2005)","DOI":"10.1287\/moor.1040.0129"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth annual ACM symposium on Theory of computing. pp. 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"key":"26_CR30","unstructured":"Klibano, P.: Uncertainty, decision, and normal form games,\". Journal of Economic Theory, forthcoming (1993)"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: PRISM-games 3.0: Stochastic game verification with concurrency, equilibria and time. In: Proc. 32nd International Conference on Computer Aided Verification (CAV\u201920). LNCS, vol. 12225, pp. 475\u2013487. Springer (2020)","DOI":"10.1007\/978-3-030-53291-8_25"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: Equilibria-based probabilistic model checking for concurrent stochastic games. In: International Symposium on Formal Methods. pp. 298\u2013315. Springer (2019)","DOI":"10.1007\/978-3-030-30942-8_19"},{"key":"26_CR33","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: Multi-player equilibria verification for concurrent stochastic games. In: International Conference on Quantitative Evaluation of Systems. pp. 74\u201395. Springer (2020)"},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: Automatic verification of concurrent stochastic systems. Formal Methods in System Design 58(1), 188\u2013250 (2021)","DOI":"10.1007\/s10703-020-00356-y"},{"key":"26_CR35","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: Correlated equilibria and fairness in concurrent stochastic games. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. pp. 60\u201378. Springer (2022)","DOI":"10.1007\/978-3-030-99527-0_4"},{"key":"26_CR36","doi-asserted-by":"crossref","unstructured":"Lemke, C.E., Howson, Jr, J.T.: Equilibrium points of bimatrix games. Journal of the Society for industrial and Applied Mathematics 12(2), 413\u2013423 (1964)","DOI":"10.1137\/0112033"},{"key":"26_CR37","doi-asserted-by":"crossref","unstructured":"Littman, M.L.: Markov games as a framework for multi-agent reinforcement learning. In: Machine learning proceedings 1994, pp. 157\u2013163. Elsevier (1994)","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"key":"26_CR38","doi-asserted-by":"crossref","unstructured":"Martin, D.A.: The determinacy of blackwell games. The Journal of Symbolic Logic 63(4), 1565\u20131581 (1998)","DOI":"10.2307\/2586667"},{"key":"26_CR39","doi-asserted-by":"crossref","unstructured":"Meggendorfer, T., Weininger, M., Wienh\u00f6ft, P.: Solving robust Markov decision processes: Generic, reliable, efficient. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 39(25), pp. 26631\u201326641 (2025)","DOI":"10.1609\/aaai.v39i25.34865"},{"key":"26_CR40","doi-asserted-by":"crossref","unstructured":"v.\u00a0Neumann, J.: Zur theorie der gesellschaftsspiele. Mathematische annalen 100(1), 295\u2013320 (1928)","DOI":"10.1007\/BF01448847"},{"key":"26_CR41","doi-asserted-by":"crossref","unstructured":"Nilim, A., El\u00a0Ghaoui, L.: Robust control of Markov decision processes with uncertain transition matrices. Operations Research 53(5), 780\u2013798 (2005)","DOI":"10.1287\/opre.1050.0216"},{"key":"26_CR42","unstructured":"Osborne, M.J., et\u00a0al.: An introduction to game theory, vol.\u00a03(3). Springer (2004)"},{"key":"26_CR43","unstructured":"Perchet, V.: Finding robust nash equilibria. In: Algorithmic Learning Theory. pp. 725\u2013751. PMLR (2020)"},{"key":"26_CR44","doi-asserted-by":"crossref","unstructured":"Raghavan, T., Filar, J.A.: Algorithms for stochastic games\u2014a survey. Zeitschrift f\u00fcr Operations Research 35(6), 437\u2013472 (1991)","DOI":"10.1007\/BF01415989"},{"key":"26_CR45","unstructured":"Roch, Z., Wang, Y.: Distributionally robust Markov games with average reward (2025), https:\/\/arxiv.org\/abs\/2508.03136"},{"key":"26_CR46","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Algorithmic game theory. Communications of the ACM 53(7), 78\u201386 (2010)","DOI":"10.1145\/1785414.1785439"},{"key":"26_CR47","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: Stochastic games. Proceedings of the national academy of sciences 39(10), 1095\u20131100 (1953)","DOI":"10.1073\/pnas.39.10.1953"},{"key":"26_CR48","unstructured":"Shi, L., Mazumdar, E., Chi, Y., Wierman, A.: Sample-efficient robust multi-agent reinforcement learning in the face of environmental uncertainty. arXiv preprint arXiv:2404.18909 (2024)"},{"key":"26_CR49","doi-asserted-by":"crossref","unstructured":"Strehl, A.L., Littman, M.L.: An empirical evaluation of interval estimation for Markov decision processes. In: 16th IEEE International Conference on Tools with Artificial Intelligence. pp. 128\u2013135. IEEE (2004)","DOI":"10.1109\/ICTAI.2004.28"},{"key":"26_CR50","doi-asserted-by":"crossref","unstructured":"Strehl, A.L., Littman, M.L.: A theoretical analysis of model-based interval estimation. In: Raedt, L.D., Wrobel, S. (eds.) Machine Learning, Proceedings of the Twenty-Second International Conference (ICML 2005). pp. 856\u2013863. ACM (2005)","DOI":"10.1145\/1102351.1102459"},{"key":"26_CR51","doi-asserted-by":"crossref","unstructured":"Todd, M.J.: The many facets of linear programming. Mathematical programming 91(3), 417\u2013436 (2002)","DOI":"10.1007\/s101070100261"},{"key":"26_CR52","unstructured":"Von\u00a0Neumann, J., Morgenstern, O.: Theory of games and economic behavior, princeton (1944)"},{"key":"26_CR53","doi-asserted-by":"crossref","unstructured":"Wang, Y., Velasquez, A., Atia, G., Prater-Bennette, A., Zou, S.: Robust average-reward Markov decision processes. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37(12), pp. 15215\u201315223 (2023)","DOI":"10.1609\/aaai.v37i12.26775"},{"key":"26_CR54","doi-asserted-by":"crossref","unstructured":"Wiesemann, W., Kuhn, D., Rustem, B.: Robust Markov decision processes. Mathematics of Operations Research 38(1), 153\u2013183 (2013)","DOI":"10.1287\/moor.1120.0566"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22752-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T02:17:01Z","timestamp":1782872221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22752-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227515","9783032227522"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22752-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"16 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}