{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:55:39Z","timestamp":1752360939326,"version":"3.41.0"},"publisher-location":"Cham","reference-count":71,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_1","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"3-35","source":"Crossref","is-referenced-by-count":16,"title":["Computer Aided Synthesis: A Game-Theoretic Approach"],"prefix":"10.1007","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-45187-7_8","volume-title":"CONCUR 2003 - Concurrency Theory","author":"R Alur","year":"2003","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Playing games with boxes and diamonds. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 128\u2013143. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45187-7_8"},{"key":"1_CR2","unstructured":"Andersson, D.: An improved algorithm for discounted payoff games. In: ESSLLI Student Session, pp. 91\u201398 (2006)"},{"issue":"3","key":"1_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/320613.320614","volume":"5","author":"C Beeri","year":"1980","unstructured":"Beeri, C.: On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. Database Syst. 5(3), 241\u2013259 (1980)","journal-title":"ACM Trans. Database Syst."},{"volume-title":"Combinatorics, Words and Symbolic Dynamics","year":"2016","key":"1_CR4","unstructured":"Berth\u00e9, V., Rigo, M. (eds.): Combinatorics, Words and Symbolic Dynamics, vol. 135. Cambridge University Press, Cambridge (2016)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140\u2013156. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02658-4_14"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Boker, U., Henzinger, T.A., Otop, J.: The target discounted-sum problem. In: LICS Proceedings, pp. 750\u2013761. IEEE Computer Society (2015)","DOI":"10.1109\/LICS.2015.74"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Pure Nash equilibria in concurrent deterministic games. Logical Methods Comput. Sci. 11(2) (2015)","DOI":"10.2168\/LMCS-11(2:9)2015"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-662-49630-5_13","volume-title":"Foundations of Software Science and Computation Structures","author":"R Brenguier","year":"2016","unstructured":"Brenguier, R.: Robust equilibria in mean-payoff games. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 217\u2013233. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49630-5_13"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30000-9_1","volume-title":"Language and Automata Theory and Applications","author":"R Brenguier","year":"2016","unstructured":"Brenguier, R., Clemente, L., Hunter, P., P\u00e9rez, G.A., Randour, M., Raskin, J.-F., Sankur, O., Sassolas, M.: Non-zero sum games for reactive synthesis. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 3\u201323. Springer, Cham (2016). doi: 10.1007\/978-3-319-30000-9_1"},{"issue":"1","key":"1_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s00236-016-0273-2","volume":"54","author":"R Brenguier","year":"2017","unstructured":"Brenguier, R., Raskin, J.-F., Sankur, O.: Assume-admissible synthesis. Acta Inf. 54(1), 41\u201383 (2017)","journal-title":"Acta Inf."},{"key":"1_CR11","unstructured":"Brihaye, T., Bruy\u00e8re, V., Meunier, N., Raskin, J-F.: Weak subgame perfect equilibria and their application to quantitative reachability. In: CSL Proceedings. LIPIcs, vol. 41, pp. 504\u2013518. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-35722-0_5","volume-title":"Logical Foundations of Computer Science","author":"T Brihaye","year":"2013","unstructured":"Brihaye, T., De Pril, J., Schewe, S.: Multiplayer cost games with simple nash equilibria. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 59\u201373. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-35722-0_5"},{"key":"1_CR13","unstructured":"Bruy\u00e8re, V., Hautem, Q., Raskin, J-F.: On the complexity of heterogeneous multidimensional games. In: CONCUR Proceedings. LIPIcs, vol. 59, pp. 11:1\u201311:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Meunier, N., Raskin, J-F.: Secure equilibria in weighted games. In: CSL-LICS Proceedings, pp. 26:1\u201326:26. ACM (2014)","DOI":"10.1145\/2603088.2603109"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-54458-7_9","volume-title":"Foundations of Software Science and Computation Structures","author":"V Bruy\u00e8re","year":"2017","unstructured":"Bruy\u00e8re, V., Le Roux, S., Pauly, A., Raskin, J.-F.: On the existence of weak subgame perfect equilibria. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 145\u2013161. Springer, Heidelberg (2017). doi: 10.1007\/978-3-662-54458-7_9"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-61042-1_46","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Buhrke","year":"1996","unstructured":"Buhrke, N., Lescow, H., V\u00f6ge, J.: Strategy construction in infinite games with Streett and Rabin chain winning conditions. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 207\u2013224. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61042-1_46"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Calude, C., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: STOC Proceedings. ACM (2017, to appear)","DOI":"10.1145\/3055399.3055409"},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.ic.2016.10.012","volume":"254","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Doyen, L., Filiot, E., Raskin, J.-F.: Doomsday equilibria for omega-regular games. Inf. Comput. 254, 296\u2013315 (2017)","journal-title":"Inf. Comput."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1805950.1805953","volume":"11","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM Trans. Comput. Logic 11, 23 (2010)","journal-title":"ACM Trans. Comput. Logic"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ic.2015.03.010","volume":"242","author":"K Chatterjee","year":"2015","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)","journal-title":"Inf. Comput."},{"key":"1_CR21","unstructured":"Chatterjee, K., Dvor\u00e1k, W., Henzinger, M., Loitzenbauer, V.: Conditionally optimal algorithms for generalized B\u00fcchi games. In: MFCS Proceedings. LIPIcs, vol. 58, pp. 25:1\u201325:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"3","key":"1_CR22","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/2597631","volume":"61","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Henzinger, M.: Efficient and dynamic algorithms for alternating B\u00fcchi games and maximal end-component decomposition. J. ACM 61(3), 15:1\u201315:40 (2014)","journal-title":"J. ACM"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Games with secure equilibria. Theor. Comput. Sci. 365, 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-71389-0_12","volume-title":"Foundations of Software Science and Computational Structures","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Generalized parity games. In: Seidl, H. (ed.) FoSSaCS 2007. LNCS, vol. 4423, pp. 153\u2013167. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71389-0_12"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzi\u0144ski, M.: On nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 26\u201340. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30124-0_6"},{"key":"1_CR26","unstructured":"Condurache, R., Filiot, E., Gentilini, R., Raskin, J-F.: The complexity of rational synthesis. In: Proceedings of ICALP. LIPIcs, vol. 55, pp. 121:1\u2013121:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"1_CR27","unstructured":"De Pril, J.: Equilibria in Multiplayer Cost Games. Ph. D. thesis, University UMONS (2013)"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-662-44465-8_19","volume-title":"Mathematical Foundations of Computer Science 2014","author":"J Pril De","year":"2014","unstructured":"De Pril, J., Flesch, J., Kuipers, J., Schoenmakers, G., Vrieze, K.: Existence of secure equilibrium in multi-player games with perfect information. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 213\u2013225. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-44465-8_19"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-15648-8_7","volume-title":"Logics of Programs","author":"EA Emerson","year":"1985","unstructured":"Emerson, E.A.: Automata, tableaux, and temporal logics (extended abstract). In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 79\u201388. Springer, Heidelberg (1985). doi: 10.1007\/3-540-15648-8_7"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, Mu-calculus and determinacy. In: FOCS Proceedings, pp. 368\u2013377. IEEE Computer Society (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"issue":"3","key":"1_CR31","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"EA Emerson","year":"1987","unstructured":"Emerson, E.A., Lei, C.-L.: Modalities for model checking: branching time logic strikes back. Sci. Comput. Program. 8(3), 275\u2013306 (1987)","journal-title":"Sci. Comput. Program."},{"issue":"9\u201310","key":"1_CR32","first-page":"931","volume":"32","author":"N Fijalkow","year":"2013","unstructured":"Fijalkow, N., Horn, F.: Les jeux d\u2019accessibilit\u00e9 g\u00e9n\u00e9ralis\u00e9e. Tech. Sci. Informatiques 32(9\u201310), 931\u2013949 (2013)","journal-title":"Tech. Sci. Informatiques"},{"key":"1_CR33","volume-title":"Competitive Markov Decision Processes","author":"J Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1997)"},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1287\/moor.1100.0469","volume":"35","author":"J Flesch","year":"2010","unstructured":"Flesch, J., Kuipers, J., Mashiah-Yaakovi, A., Schoenmakers, G., Solan, E., Vrieze, K.: Perfect-information games with lower-semicontinuous payoffs. Math. Oper. Res. 35, 742\u2013755 (2010)","journal-title":"Math. Oper. Res."},{"key":"1_CR35","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0022-0531(83)90076-5","volume":"31","author":"D Fudenberg","year":"1983","unstructured":"Fudenberg, D., Levine, D.: Subgame-perfect equilibria of finite-and infinite-horizon games. J. Econ. Theor. 31, 251\u2013268 (1983)","journal-title":"J. Econ. Theor."},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-540-28629-5_53","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H Gimbert","year":"2004","unstructured":"Gimbert, H., Zielonka, W.: When can you play positionally? In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 686\u2013697. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-28629-5_53"},{"key":"1_CR37","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., Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 428\u2013442. Springer, Heidelberg (2005). doi: 10.1007\/11539452_33"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)"},{"key":"1_CR39","first-page":"151","volume-title":"New Perspectives on Games and Interaction","author":"E Gr\u00e4del","year":"2008","unstructured":"Gr\u00e4del, E., Ummels, M.: Solution concepts and algorithms for infinite multiplayer games. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction, vol. 4, pp. 151\u2013178. Amsterdam University Press, Amsterdam (2008)"},{"key":"1_CR40","doi-asserted-by":"crossref","first-page":"613","DOI":"10.2307\/1911658","volume":"53","author":"C Harris","year":"1985","unstructured":"Harris, C.: Existence and characterization of perfect equilibrium in games of perfect information. Econometrica 53, 613\u2013628 (1985)","journal-title":"Econometrica"},{"key":"1_CR41","unstructured":"Horn, F.: Explicit muller games are PTIME. In: FSTTCS Proceedings. LIPIcs, vol. 2, pp. 235\u2013243. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2008)"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11549345_43","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P Hunter","year":"2005","unstructured":"Hunter, P., Dawar, A.: Complexity bounds for regular games. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 495\u2013506. Springer, Heidelberg (2005). doi: 10.1007\/11549345_43"},{"key":"1_CR43","unstructured":"Hunter, P., Raskin, J-F.: Quantitative games with interval objectives. In: FSTTCS Proceedings. LIPIcs, vol. 29, pp. 365\u2013377. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"key":"1_CR44","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","volume":"22","author":"N Immerman","year":"1981","unstructured":"Immerman, N.: Number of quantifiers is better than number of tape cells. J. Comput. Syst. Sci. 22, 384\u2013406 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR45","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"ND Jones","year":"1975","unstructured":"Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11, 68\u201375 (1975)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1_CR46","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzinski","year":"1998","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in UP $$\\cap $$ co-UP. Inf. Process. Lett. 68(3), 119\u2013124 (1998)","journal-title":"Inf. Process. Lett."},{"key":"1_CR47","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"RM Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23, 309\u2013311 (1978)","journal-title":"Discrete Math."},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/11787006_29","volume-title":"Automata, Languages and Programming","author":"E Kopczy\u0144ski","year":"2006","unstructured":"Kopczy\u0144ski, E.: Half-positional determinacy of infinite games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 336\u2013347. Springer, Heidelberg (2006). doi: 10.1007\/11787006_29"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: Extensive games and the problem of information. In: Classics in Game Theory, pp. 46\u201368 (1953)","DOI":"10.1515\/9781400881970-012"},{"key":"1_CR50","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, vol. 90. Cambridge University Press, Cambridge (2002)"},{"key":"1_CR51","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"DA Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math. 102, 363\u2013371 (1975)","journal-title":"Ann. Math."},{"issue":"2","key":"1_CR52","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65(2), 149\u2013184 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium points in $$n$$ -person games. In: PNAS, vol. 36, pp. 48\u201349. National Academy of Sciences (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"1_CR54","volume-title":"A Course in Game Theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"1_CR55","volume-title":"Infinite Words, Automata, Semigroups, Logic and Games","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words, Automata, Semigroups, Logic and Games, vol. 141. Elsevier, Amsterdam (2004)"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Piterman, N., Pnueli, A.: Faster solutions of Rabin and Streett games. In: LICS Proceedings, pp. 275\u2013284. IEEE Computer Society (2006)","DOI":"10.1109\/LICS.2006.23"},{"issue":"3","key":"1_CR57","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1287\/moor.1110.0504","volume":"36","author":"RA Purves","year":"2011","unstructured":"Purves, R.A., Sudderth, W.D.: Perfect information games with upper semicontinuous payoffs. Math. Oper. Res. 36(3), 468\u2013473 (2011)","journal-title":"Math. Oper. Res."},{"issue":"3\u20134","key":"1_CR58","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF02020331","volume":"8","author":"A R\u00e9nyi","year":"1957","unstructured":"R\u00e9nyi, A.: Representations of real numbers and their ergodic properties. Acta Math. Acad. Scientiarum Hung. 8(3\u20134), 477\u2013493 (1957)","journal-title":"Acta Math. Acad. Scientiarum Hung."},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"Le Roux, S., Pauly, A.: Extending finite memory determinacy to multiplayer games. In: Proceedings of SR. EPTCS, vol. 218, pp. 27\u201340 (2016)","DOI":"10.4204\/EPTCS.218.3"},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"Safra, S., Vardi, M.Y.: On omega-automata and temporal logic (preliminary report). In: Proceedings of STOC, pp. 127\u2013137. ACM (1989)","DOI":"10.1145\/73007.73019"},{"key":"1_CR61","first-page":"301","volume":"121","author":"R Selten","year":"1965","unstructured":"Selten, R.: Spieltheoretische Behandlung eines Oligopolmodells mit Nachfragetr\u00e4gheit. Z. die gesamte Staatswissenschaft 121, 301\u2013324 (1965). pp. 667\u2013689","journal-title":"Z. die gesamte Staatswissenschaft"},{"key":"1_CR62","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/S0304-4068(03)00021-1","volume":"39","author":"E Solan","year":"2003","unstructured":"Solan, E., Vieille, N.: Deterministic multi-player Dynkin games. J. Math. Econ. 39, 911\u2013929 (2003)","journal-title":"J. Math. Econ."},{"key":"1_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11944836_21","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"M Ummels","year":"2006","unstructured":"Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 212\u2013223. Springer, Heidelberg (2006). doi: 10.1007\/11944836_21"},{"key":"1_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-78499-9_3","volume-title":"Foundations of Software Science and Computational Structures","author":"M Ummels","year":"2008","unstructured":"Ummels, M.: The complexity of nash equilibria in infinite multiplayer games. In: Amadio, R. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 20\u201334. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78499-9_3"},{"key":"1_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-23217-6_32","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"M Ummels","year":"2011","unstructured":"Ummels, M., Wojtczak, D.: The complexity of nash equilibria in limit-average games. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 482\u2013496. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23217-6_32"},{"key":"1_CR66","doi-asserted-by":"crossref","unstructured":"Ummels, M., Wojtczak, D.: The complexity of Nash equilibria in limit-average games. CoRR, abs\/1109.6220 (2011)","DOI":"10.2168\/LMCS-7(3:20)2011"},{"issue":"1","key":"1_CR67","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"MY Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1\u201337 (1994)","journal-title":"Inf. Comput."},{"key":"1_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-662-46678-0_20","volume-title":"Foundations of Software Science and Computation Structures","author":"Y Velner","year":"2015","unstructured":"Velner, Y.: Robust multidimensional mean-payoff games are undecidable. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 312\u2013327. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46678-0_20"},{"key":"1_CR69","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ic.2015.03.001","volume":"241","author":"Y Velner","year":"2015","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)","journal-title":"Inf. Comput."},{"key":"1_CR70","volume-title":"Theory of Games and Economic Behavior","author":"J Neumann von","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"key":"1_CR71","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158, 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T16:40:12Z","timestamp":1750783212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}