{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T23:48:57Z","timestamp":1777765737960,"version":"3.51.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031974380","type":"print"},{"value":"9783031974397","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-97439-7_4","type":"book-chapter","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T11:04:03Z","timestamp":1756551843000},"page":"99-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polytopal Stochastic Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5835-4333","authenticated-orcid":false,"given":"Pablo F.","family":"Castro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-9215","authenticated-orcid":false,"given":"Pedro R.","family":"D\u2019Argenio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Akshay, S., Bouyer, P., Krishna, S.N., Manasa, L., Trivedi, A.: Stochastic timed games revisited. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. LIPIcs, vol.\u00a058, pp. 8:1\u20138:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2016.8","DOI":"10.4230\/LIPICS.MFCS.2016.8"},{"key":"4_CR2","unstructured":"Ash, R.B., Dol\u00e9ans-Dade, C.A.: Probability and Measure Theory. Harcourt\/Academic Press, 2nd edn. (1999)"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Aslanyan, Z., Nielson, F., Parker, D.: Quantitative verification and synthesis of attack-defence scenarios. In: IEEE 29th Computer Security Foundations Symposium, CSF 2016, pp. 105\u2013119. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/CSF.2016.15","DOI":"10.1109\/CSF.2016.15"},{"key":"4_CR4","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-54862-8_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Baier","year":"2014","unstructured":"Baier, C., Klein, J., Kl\u00fcppelholz, S., M\u00e4rcker, S.: Computing conditional probabilities in Markovian models efficiently. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 515\u2013530. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_43"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-662-54580-5_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Baier","year":"2017","unstructured":"Baier, C., Klein, J., Kl\u00fcppelholz, S., Wunderlich, S.: Maximizing the conditional expected reward for reaching the goal. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 269\u2013285. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_16"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-02930-1_9","volume-title":"Automata, Languages and Programming","author":"P Bouyer","year":"2009","unstructured":"Bouyer, P., Forejt, V.: Reachability in stochastic timed games. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 103\u2013114. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_9"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Castro, P.F., D\u2019Argenio, P.R., Demasi, R., Putruele, L.: Quantifying masking fault-tolerance via fair stochastic games. In: Mezzina, C.A., Caltais, G. (eds.) Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2023, and 20th Workshop on Structural Operational Semantics. EPTCS, vol.\u00a0387, pp. 132\u2013148 (2023). https:\/\/doi.org\/10.4204\/EPTCS.387.10","DOI":"10.4204\/EPTCS.387.10"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1007\/11523468_71","volume-title":"Automata, Languages and Programming","author":"K Chatterjee","year":"2005","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of stochastic rabin and streett games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 878\u2013890. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_71"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.jcss.2011.05.002","volume":"78","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K., Henzinger, T.A.: A survey of stochastic $$\\omega $$-regular games. J. Comput. Syst. Sci. 78(2), 394\u2013413 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.05.002","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR11","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"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-40196-1_28","volume-title":"Quantitative Evaluation of Systems","author":"T Chen","year":"2013","unstructured":"Chen, T., Kwiatkowska, M., Simaitis, A., Wiltsche, C.: Synthesis for multi-objective stochastic games: an application to autonomous urban driving. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 322\u2013337. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40196-1_28"},{"issue":"2","key":"4_CR13","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":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TASE.2016.2530623","volume":"13","author":"L Feng","year":"2016","unstructured":"Feng, L., Wiltsche, C., Humphrey, L.R., Topcu, U.: Synthesis of human-in-the-loop control protocols for autonomous systems. IEEE Trans. Autom. Sci. Eng. 13(2), 450\u2013462 (2016). https:\/\/doi.org\/10.1109\/TASE.2016.2530623","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4054-9","volume-title":"Competitive Markov Decision Processes","author":"J Filar","year":"1996","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1996)"},{"key":"4_CR16","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0092872","volume-title":"Categorical Aspects of Topology and Analysis","author":"M Giry","year":"1982","unstructured":"Giry, M.: A categorical approach to probability theory. In: Banaschewski, B. (ed.) Categorical Aspects of Topology and Analysis. LNM, vol. 915, pp. 68\u201385. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0092872"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proceedings of the 6th Annual Symposium on Logic in Computer Science (LICS 1991), pp. 266\u2013277. IEEE Computer Society (1991). https:\/\/doi.org\/10.1109\/LICS.1991.151651","DOI":"10.1109\/LICS.1991.151651"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-99154-2_13","volume-title":"Quantitative Evaluation of Systems","author":"S Junges","year":"2018","unstructured":"Junges, S., Jansen, N., Katoen, J.-P., Topcu, U., Zhang, R., Hayhoe, M.: Model checking for safe navigation among humans. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 207\u2013222. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99154-2_13"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Kaibel, V., Pfetsch, M.E.: Some algorithmic problems in polytope theory. In: Joswig, M., Takayama, N. (eds.) Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], pp. 23\u201347. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/978-3-662-05148-1_2","DOI":"10.1007\/978-3-662-05148-1_2"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1014745904458","volume":"8","author":"I Kozine","year":"2002","unstructured":"Kozine, I., Utkin, L.V.: Interval-valued finite Markov chains. Reliab. Comput. 8(2), 97\u2013113 (2002). https:\/\/doi.org\/10.1023\/A:1014745904458","journal-title":"Reliab. Comput."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Kucera, 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)","DOI":"10.1017\/CBO9780511973468.006"},{"key":"4_CR22","unstructured":"Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems, 3rd edn. Texts in Statistical Science, CRC Press (2017)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-319-66197-1_22","volume-title":"Software Engineering and Formal Methods","author":"S M\u00e4rcker","year":"2017","unstructured":"M\u00e4rcker, S., Baier, C., Klein, J., Kl\u00fcppelholz, S.: Computing conditional probabilities: implementation and evaluation. In: Cimatti, A., Sirjani, M. (eds.) SEFM 2017. LNCS, vol. 10469, pp. 349\u2013366. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66197-1_22"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"McMullen, P.: Geometric Regular Polytopes. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2020)","DOI":"10.1017\/9781108778992"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-030-17127-8_25","volume-title":"Foundations of Software Science and Computation Structures","author":"J Piribauer","year":"2019","unstructured":"Piribauer, J., Baier, C.: Partial and conditional expectations in Markov decision processes with integer weights. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 436\u2013452. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_25"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-39799-8_35","volume-title":"Computer Aided Verification","author":"A Puggelli","year":"2013","unstructured":"Puggelli, A., Li, W., Sangiovanni-Vincentelli, A.L., Seshia, S.A.: Polynomial-time verification of PCTL properties of MDPs with convex uncertainties. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 527\u2013542. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_35"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics, Wiley (1994). https:\/\/doi.org\/10.1002\/9780470316887","DOI":"10.1002\/9780470316887"},{"key":"4_CR28","unstructured":"R.\u00a0S.\u00a0Sutton, A.G.B..: Reinforcement Learning: An Introduction. Bradford Books (2018)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/11691372_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Sen","year":"2006","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Model-checking Markov chains in the presence of uncertainties. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 394\u2013410. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_26"},{"issue":"10","key":"4_CR30","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. U.S.A. 39(10), 1095\u2013100 (1953). https:\/\/doi.org\/10.1073\/pnas.39.10.1095","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1109\/TRO.2020.3047521","volume":"37","author":"M Wang","year":"2021","unstructured":"Wang, M., Wang, Z., Talbot, J., Gerdes, J.C., Schwager, M.: Game-theoretic planning for self-driving cars in multivehicle competitive scenarios. IEEE Trans. Robot. 37(4), 1313\u20131325 (2021). https:\/\/doi.org\/10.1109\/TRO.2020.3047521","journal-title":"IEEE Trans. Robot."},{"key":"4_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes, Graduate Texts in Mathematics","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Principles of Formal Quantitative Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97439-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:29:00Z","timestamp":1777476540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97439-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"ISBN":["9783031974380","9783031974397"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97439-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,30]]},"assertion":[{"value":"30 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}