{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T08:04:14Z","timestamp":1764403454750,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031787089"},{"type":"electronic","value":"9783031787096"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78709-6_6","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:45Z","timestamp":1738361445000},"page":"110-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Games with Weighted Multiple Objectives"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4699-6117","authenticated-orcid":false,"given":"Orna","family":"Kupferman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1994-6835","authenticated-orcid":false,"given":"Noam","family":"Shenwald","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"de\u00a0Alfaro, L., Henzinger, T., Majumdar, R.: Discounting the future in systems theory. In: Proc. 30th Int. Colloq. on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol.\u00a02719, pp. 1022\u20131037 (2003)","DOI":"10.1007\/3-540-45061-0_79"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. J. ACM 63(3), 24:1\u201324:56 (2016)","DOI":"10.1145\/2875421"},{"issue":"6\u20137","key":"6_CR3","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1142\/S0129054119400203","volume":"30","author":"S Almagor","year":"2019","unstructured":"Almagor, S., Kuperberg, D., Kupferman, O.: Sensing as a complexity measure. Int. J. Found. Comput. Sci. 30(6\u20137), 831\u2013873 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Avni, G., Henzinger, T., Chonev, V.: Infinite-duration bidding games. J. ACM 66(4), 31:1\u201331:29 (2019)","DOI":"10.1145\/3340295"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bloem, R., Chatterjee, K., Jobstmann, B.: Graph games and reactive synthesis. In: Handbook of Model Checking., pp. 921\u2013962. Springer (2018)","DOI":"10.1007\/978-3-319-10575-8_27"},{"key":"6_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-36742-7_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Bohy","year":"2013","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Raskin, J.-F.: Synthesis from LTL specifications with mean-payoff objectives. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 169\u2013184. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_12"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Boker, U., Chatterjee, K., Henzinger, T., Kupferman, O.: Temporal specifications with accumulative values. In: Proceedings of the 26th IEEE Symposium on Logic in Computer Science, pp. 43\u201352 (2011)","DOI":"10.1109\/LICS.2011.33"},{"key":"6_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-28729-9_20","volume-title":"Foundations of Software Science and Computational Structures","author":"P Bouyer","year":"2012","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Concurrent games with ordered objectives. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 301\u2013315. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_20"},{"key":"6_CR9","unstructured":"Bouyer, P., N, F., Randour, M., Vandenhove, P.: How to play optimally for regular objectives? (2023)"},{"key":"6_CR10","unstructured":"B\u00fcchi, J.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Method, and Philosophy of Science. 1960, pp. 1\u201312. Stanford University Press (1962)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L.: Energy and mean-payoff parity markov decision processes. In: 36th International Symposium on Mathematical Foundations of Computer Science, pp. 206\u2013218 (2011)","DOI":"10.1007\/978-3-642-22993-0_21"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.07.038","volume":"458","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K., Doyen, L.: Energy parity games. Theoret. Comput. Sci. 458, 49\u201360 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR13","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T., Raskin, J.F.: Generalized mean-payoff and energy games. In: Proc. 30th Conf. on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol.\u00a08, pp. 505\u2013516. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"6_CR14","unstructured":"Chatterjee, K., Dvorak, W., Henzinger, M., Loitzenbauer, V.: Conditionally optimal algorithms for generalized b\u00fcchi games. In: 41st Int. Symp. on Mathematical Foundations of Computer Science. LIPIcs, vol.\u00a058, pp. 25:1\u201325:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"6_CR15","series-title":"LNCS","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). https:\/\/doi.org\/10.1007\/978-3-540-71389-0_12"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. In: Proceedings of the 18th International Conference on Concurrency Theory, pp. 59\u201373 (2007)","DOI":"10.1007\/978-3-540-74407-8_5"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Kom\u00e1rkov\u00e1, Z., Kret\u00ednsk\u00fd, J.: Unifying two views on multiple mean-payoff objectives in markov decision processes. In: Proceedings of the 30th IEEE Symposium on Logic in Computer Science, pp. 244\u2013256 (2015)","DOI":"10.1109\/LICS.2015.32"},{"key":"6_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-78929-1_6","volume-title":"Hybrid Systems: Computation and Control","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Majumdar, R., Henzinger, T.A.: Controller synthesis with budget constraints. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 72\u201386. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78929-1_6"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Jurdzinski, M., Walukiewicz, I.: How much memory is needed to win infinite games. In: Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pp. 99\u2013110 (1997)","DOI":"10.1109\/LICS.1997.614939"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs. In: Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pp. 328\u2013337 (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"key":"6_CR21","unstructured":"Fijalkow, N., Horn, F.: The surprizing complexity of reachability games. CoRR abs\/1010.2420 (2010)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A., Chechik, M.: Multi-valued model-checking via classical model-checking. In: Proceedings of the 14th International Conference on Concurrency Theory, pp. 263\u2013277. Springer-Verlag (2003)","DOI":"10.1007\/978-3-540-45187-7_18"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K. (ed.) Logics and Models of Concurrent Systems, NATO Advanced Summer Institutes, vol.\u00a0F-13, pp. 477\u2013498. Springer (1985)","DOI":"10.1007\/978-3-642-82453-1_17"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Henzinger, T.: From Boolean to quantitative notions of correctness. In: Proceedings of the 37th ACM Symposium on Principles of Programming Languages, pp. 157\u2013158 (2010)","DOI":"10.1145\/1706299.1706319"},{"key":"6_CR25","unstructured":"Holtmann, M.: Memory and delay in regular infinite games. Ph.D. thesis, RWTH Aachen University (2011)"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Hunter, P., Dawar, A.: Complexity Bounds for Regular Games. MFCS 2005. LNCS, vol. 3618, pp. 495\u2013506. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_43","DOI":"10.1007\/11549345_43"},{"issue":"3","key":"6_CR27","doi-asserted-by":"publisher","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(3), 384\u2013406 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Kupferman, O.: Automata theory and model checking. In: Handbook of Model Checking, pp. 107\u2013151. Springer (2018)","DOI":"10.1007\/978-3-319-10575-8_4"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-016-9508-8","volume":"78","author":"O Kupferman","year":"2016","unstructured":"Kupferman, O., Perelli, G., Vardi, M.Y.: Synthesis with rational environments. Ann. Math. Artif. Intell. 78(1), 3\u201320 (2016). https:\/\/doi.org\/10.1007\/s10472-016-9508-8","journal-title":"Ann. Math. Artif. Intell."},{"key":"6_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11817963_6","volume-title":"Computer Aided Verification","author":"O Kupferman","year":"2006","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: Safraless Compositional Synthesis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 31\u201344. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_6"},{"key":"6_CR31","unstructured":"Kupferman, O., Shenwald, N.: Games with trading of control. In: Proceedings of the 34th Internatinoal Conference on Concurrency Theory. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0279, pp. 19:1\u201319:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"6_CR32","unstructured":"Kupferman, O., Tamir, T.: Alternating reachability games with behavioral and revenue objectives. In: Proceeedings of the 22nd Interenational Conferene on Logic for Programming Artificial Intelligence and Reasoning (2018)"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"65","author":"D Martin","year":"1975","unstructured":"Martin, D.: Borel determinacy. Ann. Math. 65, 363\u2013371 (1975)","journal-title":"Ann. Math."},{"issue":"4","key":"6_CR34","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(02)00285-5","volume":"84","author":"J Neumann","year":"2002","unstructured":"Neumann, J., Szepietowski, A., Walukiewicz, I.: Complexity of weak acceptance conditions in tree automata. Inf. Process. Lett. 84(4), 181\u2013187 (2002)","journal-title":"Inf. Process. Lett."},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Piterman, N., Pnueli, A., Saar, Y.: Synthesis of reactive(1) designs. In: Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation. LNCS, vol.\u00a03855, pp. 364\u2013380. Springer (2006)","DOI":"10.1007\/11609773_24"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ic.2019.04.001","volume":"267","author":"R Rizzi","year":"2019","unstructured":"Rizzi, R., Tomescu, A.: Faster fptases for counting and random generation of knapsack solutions. Inf. Comput. 267, 135\u2013144 (2019)","journal-title":"Inf. Comput."},{"key":"6_CR39","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-59042-0_57","volume-title":"STACS 95","author":"W Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1\u201313. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_57"},{"issue":"2","key":"6_CR40","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M Vardi","year":"1986","unstructured":"Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32(2), 182\u2013221 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR41","doi-asserted-by":"publisher","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., Rabinovich, A., Raskin, J.F.: The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241, 177\u2013196 (2015)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78709-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:11:02Z","timestamp":1738361462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78709-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031787089","9783031787096"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78709-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}