{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:28:14Z","timestamp":1762291694208,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095237","type":"print"},{"value":"9783032095244","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"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-032-09524-4_3","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:02Z","timestamp":1762290842000},"page":"31-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simplicity Lies in\u00a0the\u00a0Eye of\u00a0the\u00a0Beholder: A Strategic Perspective on\u00a0Controllers in\u00a0Reactive Synthesis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8777-2385","authenticated-orcid":false,"given":"Mickael","family":"Randour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Ajdar\u00f3w, M., Main, J.C.A., Novotn\u00fd, P., Randour, M.: Taming infinity one chunk at a time: concisely represented strategies in one-counter MDPs. In: Censor-Hillel, K., Grandoni, F., Ouaknine, J., Puppis, G. (eds.) 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, Aarhus, Denmark, 8\u201311 July 2025. LIPIcs, vol.\u00a0334, pp. 138:1\u2013138:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2025.138","DOI":"10.4230\/LIPICS.ICALP.2025.138"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Aumann, R.J..: Mixed and behavior strategies in infinite extensive games. In: Dresher, M., Shapley, L.S., Tucker, A.W. (eds.) Advances in Game Theory. (AM-52), vol. 52, pp. 627\u2013650. Princeton University Press (1964). https:\/\/doi.org\/10.1515\/9781400882014-029","DOI":"10.1515\/9781400882014-029"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. J. ACM 64(5), 33:1\u201333:48 (2017). https:\/\/doi.org\/10.1145\/3107926","DOI":"10.1145\/3107926"},{"issue":"1\u20132","key":"3_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/S10472-011-9250-1","volume":"62","author":"A Bianco","year":"2011","unstructured":"Bianco, A., Faella, M., Mogavero, F., Murano, A.: Exploring the boundary of half-positionality. Ann. Math. Artif. Intell. 62(1\u20132), 55\u201377 (2011). https:\/\/doi.org\/10.1007\/S10472-011-9250-1","journal-title":"Ann. Math. Artif. Intell."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-53291-8_22","volume-title":"Computer Aided Verification","author":"F Blahoudek","year":"2020","unstructured":"Blahoudek, F., Br\u00e1zdil, T., Novotn\u00fd, P., Ornik, M., Thangeda, P., Topcu, U.: Qualitative controller synthesis for consumption markov decision processes. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 421\u2013447. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_22"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/978-3-319-10575-8_27","volume-title":"Handbook of Model Checking","author":"R Bloem","year":"2018","unstructured":"Bloem, R., Chatterjee, K., Jobstmann, B.: Graph games and reactive synthesis. In: Handbook of Model Checking, pp. 921\u2013962. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_27"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Casares, A., Randour, M., Vandenhove, P.: Half-positional objectives recognized by deterministic B\u00fcchi automata. Log. Methods Comput. Sci. 20(3) (2024). https:\/\/doi.org\/10.46298\/LMCS-20(3:19)2024","DOI":"10.46298\/LMCS-20(3:19)2024"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Fijalkow, N., Randour, M., Vandenhove, P.: How to play optimally for regular objectives? In: Etessami, K., Feige, U., Puppis, G. (eds.) 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, 10\u201314 July 2023. LIPIcs, vol.\u00a0261, pp. 118:1\u2013118:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2023.118","DOI":"10.4230\/LIPICS.ICALP.2023.118"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Le\u00a0Roux, S., Oualhadj, Y., Randour, M., Vandenhove, P.: Games where you can play optimally with arena-independent finite memory. Log. Methods Comput. Sci. 18(1) (2022). https:\/\/doi.org\/10.46298\/LMCS-18(1:11)2022","DOI":"10.46298\/LMCS-18(1:11)2022"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/S00236-016-0274-1","volume":"55","author":"P Bouyer","year":"2018","unstructured":"Bouyer, P., Markey, N., Randour, M., Larsen, K.G., Laursen, S.: Average-energy games. Acta Informatica 55(2), 91\u2013127 (2018). https:\/\/doi.org\/10.1007\/S00236-016-0274-1","journal-title":"Acta Informatica"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Oualhadj, Y., Randour, M., Vandenhove, P.: Arena-independent finite-memory determinacy in stochastic games. Log. Methods Comput. Sci. 19(4) (2023). https:\/\/doi.org\/10.46298\/LMCS-19(4:18)2023","DOI":"10.46298\/LMCS-19(4:18)2023"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Randour, M., Vandenhove, P.: The true colors of memory: a tour of chromatic-memory strategies in zero-sum games on graphs. In: Dawar, A., Guruswami, V. (eds.) 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, IIT Madras, Chennai, India, 18\u201320 December 2022. LIPIcs, vol.\u00a0250, pp. 3:1\u20133:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2022.3","DOI":"10.4230\/LIPICS.FSTTCS.2022.3"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Randour, M., Vandenhove, P.: Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs. TheoretiCS 2 (2023). https:\/\/doi.org\/10.46298\/THEORETICS.23.1","DOI":"10.46298\/THEORETICS.23.1"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-21690-4_10","volume-title":"Computer Aided Verification","author":"T Br\u00e1zdil","year":"2015","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Chmel\u00edk, M., Fellner, A., K\u0159et\u00ednsk\u00fd, J.: Counterexample explanation by learning small strategies in markov decision processes. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 158\u2013177. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_10"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-89960-2_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Br\u00e1zdil","year":"2018","unstructured":"Br\u00e1zdil, T., Chatterjee, K., K\u0159et\u00ednsk\u00fd, J., Toman, V.: Strategy representation by decision trees in\u00a0reactive\u00a0synthesis. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 385\u2013407. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_21"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Brihaye, T., Delgrange, F., Oualhadj, Y., Randour, M.: Life is random, time is not: Markov decision processes with window objectives. Log. Methods Comput. Sci. 16(4) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(4:13)2020","DOI":"10.23638\/LMCS-16(4:13)2020"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Brihaye, T., Goeminne, A., Main, J.C.A., Randour, M.: Reachability games and friends: a journey through the lens of memory and complexity. In: Bouyer, P., Srinivasan, S. (eds.) 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, 18\u201320 December 2023, IIIT Hyderabad, Telangana, India. LIPIcs, vol.\u00a0284, pp. 1:1\u20131:26. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2023.1","DOI":"10.4230\/LIPICS.FSTTCS.2023.1"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Hautem, Q., Randour, M.: Window parity games: an alternative approach toward parity games with time bounds. In: Cantone, D., Delzanno, G. (eds.) Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, Catania, Italy, 14\u201316 September 2016. EPTCS, vol.\u00a0226, pp. 135\u2013148 (2016https:\/\/doi.org\/10.4204\/EPTCS.226.10","DOI":"10.4204\/EPTCS.226.10"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Hautem, Q., Randour, M., Raskin, J.F.: Energy mean-payoff games. In: Fokkink, W.J., van Glabbeek, R. (eds.) 30th International Conference on Concurrency Theory, CONCUR 2019, Amsterdam, the Netherlands, 27\u201330 August 2019. LIPIcs, vol.\u00a0140, pp. 21:1\u201321:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2019.21","DOI":"10.4230\/LIPICS.CONCUR.2019.21"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Filiot, E., Randour, M., Raskin, J.F.: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games. Inf. Comput. 254, 259\u2013295 (2017). https:\/\/doi.org\/10.1016\/J.IC.2016.10.011","DOI":"10.1016\/J.IC.2016.10.011"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Carr, S., Jansen, N., Topcu, U.: Verifiable RNN-based policies for POMDPs under temporal logic constraints. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 4121\u20134127. ijcai.org (2020). https:\/\/doi.org\/10.24963\/IJCAI.2020\/570","DOI":"10.24963\/IJCAI.2020\/570"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Casares, A., Ohlmann, P.: Positional $$\\omega $$-regular languages. In: Sobocinski, P., Lago, U.D., Esparza, J. (eds.) Proceedings of the 39th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, 8\u201311 July 2024, pp. 21:1\u201321:14. ACM (2024). https:\/\/doi.org\/10.1145\/3661814.3662087","DOI":"10.1145\/3661814.3662087"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Casares, A., Ohlmann, P.: Characterising memory in infinite games. Log. Methods Comput. Sci. 21(1) (2025). https:\/\/doi.org\/10.46298\/LMCS-21(1:28)2025","DOI":"10.46298\/LMCS-21(1:28)2025"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Trading memory for randomness. In: 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), Enschede, The Netherlands, 27\u201330 September 2004, pp. 206\u2013217. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/QEST.2004.1348035","DOI":"10.1109\/QEST.2004.1348035"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L., Gimbert, H., Henzinger, T.A.: Randomness for free. Inf. Comput. 245, 3\u201316 (2015). https:\/\/doi.org\/10.1016\/J.IC.2015.06.003","DOI":"10.1016\/J.IC.2015.06.003"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L., Randour, M., Raskin, J.F.: Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242, 25\u201352 (2015). https:\/\/doi.org\/10.1016\/J.IC.2015.03.010","DOI":"10.1016\/J.IC.2015.03.010"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-78929-1_7","volume-title":"Hybrid Systems: Computation and Control","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Henzinger, T.A., Prabhu, V.S.: Trading infinite memory for uniform randomness in timed games. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 87\u2013100. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78929-1_7"},{"issue":"3\u20134","key":"3_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/S00236-013-0182-6","volume":"51","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Randour, M., Raskin, J.F.: Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica 51(3\u20134), 129\u2013163 (2014). https:\/\/doi.org\/10.1007\/S00236-013-0182-6","journal-title":"Acta Informatica"},{"key":"3_CR29","first-page":"3","volume":"1","author":"A Church","year":"1957","unstructured":"Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. Summ. Summer Inst. Symb. Logic 1, 3\u201350 (1957)","journal-title":"Summ. Summer Inst. Symb. Logic"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Cristau, J., David, C., Horn, F.: How do we remember the past in randomised strategies? In: Montanari, A., Napoli, M., Parente, M. (eds.) Proceedings First Symposium on Games, Automata, Logic, and Formal Verification, GANDALF 2010, Minori (Amalfi Coast), Italy, 17\u201318 June 2010. EPTCS, vol.\u00a025, pp. 30\u201339 (2010). https:\/\/doi.org\/10.4204\/EPTCS.25.7","DOI":"10.4204\/EPTCS.25.7"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-030-45190-5_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Delgrange","year":"2020","unstructured":"Delgrange, F., Katoen, J.-P., Quatmann, T., Randour, M.: Simple strategies in multi-objective MDPs. In: TACAS 2020. LNCS, vol. 12078, pp. 346\u2013364. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_19"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Fijalkow, N., et al.: Games on Graphs: From Logic and Automata to Algorithms. Cambridge University Press, Cambridge (2025). https:\/\/doi.org\/10.48550\/ARXIV.2305.10546, in press","DOI":"10.48550\/ARXIV.2305.10546"},{"key":"3_CR33","unstructured":"Gelderie, M.: Strategy machines: representation and complexity of strategies in infinite games. Ph.D. thesis, RWTH Aachen University (2014). https:\/\/publications.rwth-aachen.de\/record\/229827\/files\/5025.pdf"},{"issue":"4","key":"3_CR34","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/S00182-023-00860-5","volume":"52","author":"H Gimbert","year":"2023","unstructured":"Gimbert, H., Kelmendi, E.: Submixing and shift-invariant stochastic games. Int. J. Game Theory 52(4), 1179\u20131214 (2023). https:\/\/doi.org\/10.1007\/S00182-023-00860-5","journal-title":"Int. J. Game Theory"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11539452_33","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"H Gimbert","year":"2005","unstructured":"Gimbert, H., Zielonka, W.: Games where you can play optimally without any memory. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 428\u2013442. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_33"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Horn, F.: Random fruits on the Zielonka tree. In: Albers, S., Marion, J.Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, 26\u201328 February 2009, Proceedings. LIPIcs, vol.\u00a03, pp. 541\u2013552. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2009). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2009.1848","DOI":"10.4230\/LIPICS.STACS.2009.1848"},{"key":"3_CR38","unstructured":"Kopczy\u0144ski, E.: Half-positional Determinacy of Infinite Games. Ph.D. thesis, Warsaw University (2008). https:\/\/www.mimuw.edu.pl\/~erykk\/papers\/hpwc.pdf"},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Le Roux, S., Pauly, A.: Extending finite memory determinacy to multiplayer games. In: Lomuscio, A., Vardi, M.Y. (eds.) Proceedings of the 4th International Workshop on Strategic Reasoning, SR 2016, New York City, USA, 10 July 2016. EPTCS, vol.\u00a0218, pp. 27\u201340 (2016). https:\/\/doi.org\/10.4204\/EPTCS.218.3","DOI":"10.4204\/EPTCS.218.3"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Le\u00a0Roux, S., Pauly, A., Randour, M.: Extending finite-memory determinacy by Boolean combination of winning conditions. In: Ganguly, S., Pandya, P.K. (eds.) 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, Ahmedabad, India, 11\u201313 December 2018. LIPIcs, vol.\u00a0122, pp. 38:1\u201338:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2018.38","DOI":"10.4230\/LIPICS.FSTTCS.2018.38"},{"key":"3_CR41","doi-asserted-by":"publisher","unstructured":"Main, J.C.A., Randour, M.: Different strokes in randomised strategies: revisiting Kuhn\u2019s theorem under finite-memory assumptions. Inf. Comput. 301 (2024). https:\/\/doi.org\/10.1016\/J.IC.2024.105229","DOI":"10.1016\/J.IC.2024.105229"},{"key":"3_CR42","doi-asserted-by":"publisher","unstructured":"Main, J.C.A., Randour, M.: Mixing any cocktail with limited ingredients: on the structure of payoff sets in multi-objective MDPs and its impact on randomised strategies. CoRR arxiv:2502.18296 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2502.18296","DOI":"10.48550\/ARXIV.2502.18296"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Monmege, B., Parreaux, J., Reynier, P.A.: Playing stochastically in weighted timed games to emulate memory. Log. Methods Comput. Sci. 21(1) (2025). https:\/\/doi.org\/10.46298\/LMCS-21(1:19)2025","DOI":"10.46298\/LMCS-21(1:19)2025"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-16066-3_15","volume-title":"Computation Theory","author":"AW Mostowski","year":"1985","unstructured":"Mostowski, A.W.: Regular expressions for infinite trees and a standard form of automata. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 157\u2013168. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-16066-3_15"},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Randour, M.: Automated synthesis of reliable and efficient systems through game theory: a case study. In: Proceedings of the European Conference on Complex Systems 2012, ECCS 2012, Brussels, Belgium, 2\u20137 September 2012. pp. 731\u2013738. Springer Proceedings in Complexity. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-319-00395-5_90","DOI":"10.1007\/978-3-319-00395-5_90"},{"key":"3_CR46","doi-asserted-by":"publisher","unstructured":"Randour, M.: Games with multiple objectives. In: Fijalkow, N. (ed.) Games on Graphs: From Logic and Automata to Algorithms, pp. 488\u2013527. Cambridge University Press, Cambridge (2025). https:\/\/doi.org\/10.48550\/ARXIV.2305.10546","DOI":"10.48550\/ARXIV.2305.10546"},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-46081-8_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M Randour","year":"2015","unstructured":"Randour, M., Raskin, J.-F., Sankur, O.: Variations on the stochastic shortest path problem. In: D\u2019Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 1\u201318. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46081-8_1"},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Randour, M., Raskin, J.-F., Sankur, O.: Percentile queries in multi-dimensional Markov decision processes. Formal Methods Syst. Des. (2), 207\u2013248 (2017). https:\/\/doi.org\/10.1007\/s10703-016-0262-7","DOI":"10.1007\/s10703-016-0262-7"},{"key":"3_CR49","doi-asserted-by":"publisher","unstructured":"Shabadi, G., Fijalkow, N., Matricon, T.: Programmatic reinforcement learning: navigating gridworlds. In: Proceedings of the International AAAI Workshop on Generalization in Planning, GenPlan 2025 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2402.11650","DOI":"10.48550\/ARXIV.2402.11650"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00596-1_1","volume-title":"Foundations of Software Science and Computational Structures","author":"W Thomas","year":"2009","unstructured":"Thomas, W.: Facets of synthesis: revisiting church\u2019s problem. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 1\u201314. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_1"},{"key":"3_CR51","doi-asserted-by":"publisher","unstructured":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T.A., Rabinovich, A.M., Raskin, J.F.: The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241, 177\u2013196 (2015). https:\/\/doi.org\/10.1016\/J.IC.2015.03.001","DOI":"10.1016\/J.IC.2015.03.001"},{"issue":"1","key":"3_CR52","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1), 135\u2013183 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(98)00009-7","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:06Z","timestamp":1762290846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}