{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:15:11Z","timestamp":1784873711230,"version":"3.55.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319299990","type":"print"},{"value":"9783319300009","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30000-9_1","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T16:45:50Z","timestamp":1456418750000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Non-Zero Sum Games for Reactive Synthesis"],"prefix":"10.1007","author":[{"given":"Romain","family":"Brenguier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Clemente","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Hunter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mickael","family":"Randour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathieu","family":"Sassolas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/1721837.1721844","volume":"6","author":"B Aminof","year":"2010","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Reasoning about online algorithms with weighted automata. ACM Trans. Algorithms 6(2), 28:1\u201328:36 (2010). doi:\n                      10.1145\/1721837.1721844\n                      \n                    . \n                      http:\/\/doi.acm.org\/10.1145\/1721837.1721844","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-70918-3_17","volume-title":"STACS 2007","author":"D Berwanger","year":"2007","unstructured":"Berwanger, D.: Admissibility in infinite games. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 188\u2013199. Springer, Heidelberg (2007)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bloem, R., Ehlers, R., Jacobs, S., K\u00f6nighofer, R.: How to handle assumptions in synthesis. In: Proceedings of SYNT. EPTCS, vol. 157, pp. 34\u201350 (2014)","DOI":"10.4204\/EPTCS.157.7"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1111\/j.1468-0262.2008.00835.x","volume":"76","author":"A Brandenburger","year":"2008","unstructured":"Brandenburger, A., Friedenberg, A., Keisler, H.J.: Admissibility in games. Econometrica 76(2), 307\u2013352 (2008)","journal-title":"Econometrica"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Forejt, V., Kucera, A.: Trading performance for stability in Markov decision processes. In: Proceedings of LICS, pp. 331\u2013340. IEEE (2013)","DOI":"10.1109\/LICS.2013.39"},{"key":"1_CR7","unstructured":"Brenguier, R., Raskin, J.-F., Sankur, O.: Assume-admissible synthesis. In: Proceedings of CONCUR. LIPIcs, vol. 42, pp. 100\u2013113. Schloss Dagstuhl-LZI (2015)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Brenguier, R., Raskin, J.-F., Sassolas, M.: The complexity of admissibility in omega-regular games. In: Proceedings of CSL-LICS, pp. 23:1\u201323:10. ACM (2014)","DOI":"10.1145\/2603088.2603143"},{"key":"1_CR9","unstructured":"Brihaye, T., Bruy\u00e8re, V., Meunier, N., Raskin, J.-F.: Weak subgame perfect equilibria and their application to quantitative reachability. In: Proceedings of CSL. LIPIcs, vol. 41, pp. 504\u2013518. Schloss Dagstuhl - LZI (2015)"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-010-0105-x","volume":"38","author":"L Brim","year":"2011","unstructured":"Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.-F.: Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2), 97\u2013118 (2011)","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Filiot, E., Randour, M., Raskin, J.-F.: Expectations or guarantees? I want it all! A crossroad between games and MDPs. In: Proceedings of SR. EPTCS, vol. 146, pp. 1\u20138 (2014)","DOI":"10.4204\/EPTCS.146.1"},{"key":"1_CR12","unstructured":"Bruy\u00e8re, V., Filiot, E., Randour, M., Raskin, J.-F.: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games. In: Proceedings of STACS. LIPIcs, vol. 25, pp. 199\u2013213. Schloss Dagstuhl - LZI (2014)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Meunier, N., Raskin, J.-F.: Secure equilibria in weighted games. In: Proceedings of CSL-LICS, pp. 26:1\u201326:26. ACM (2014)","DOI":"10.1145\/2603088.2603109"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-54013-4_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L., Filiot, E., Raskin, J.-F.: Doomsday equilibria for omega-regular games. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 78\u201397. Springer, Heidelberg (2014)"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"23:1","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(4), 23:1\u201323:38 (2010). doi:\n                      10.1145\/1805950.1805953\n                      \n                    . \n                      http:\/\/doi.acm.org\/10.1145\/1805950.1805953","journal-title":"Quantitative languages. ACM Trans. Comput. Logic"},{"key":"1_CR16","doi-asserted-by":"publisher","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_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 261\u2013275. Springer, Heidelberg (2007)"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. Theoret. Comput. Sci. 365(1), 67\u201382 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"1_CR19","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","volume":"208","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Inf. Comput. 208(6), 677\u2013693 (2010)","journal-title":"Inf. Comput."},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1981","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logics of Programs. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1981)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Clemente, L., Raskin, J.-F.: Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives. In: Proceedings of LICS, pp. 257\u2013268. IEEE (2015)","DOI":"10.1109\/LICS.2015.33"},{"key":"1_CR22","unstructured":"Colcombet, T.: Forms of determinism for automata. In: Proceedings of STACS. LIPIcs, vol. 14, pp. 1\u201323. Schloss Dagstuhl - LZI (2012)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-21437-0_4","volume-title":"FM 2011: Formal Methods","author":"W Damm","year":"2011","unstructured":"Damm, W., Finkbeiner, B.: Does it pay to extend the perimeter of a world model? In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 12\u201326. Springer, Heidelberg (2011)"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8, 109\u2013113 (1979)","journal-title":"Int. J. Game Theory"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-03816-7_27","volume-title":"Mathematical Foundations of Computer Science 2009","author":"M Faella","year":"2009","unstructured":"Faella, M.: Admissible strategies in infinite games over graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 307\u2013318. Springer, Heidelberg (2009)"},{"key":"1_CR26","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_CR27","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/9.362904","volume":"40","author":"JA Filar","year":"1995","unstructured":"Filar, J.A., Krass, D., Ross, K.W.: Percentile performance criteria for limiting average Markov decision processes. Trans. Autom. Control 40, 2\u201310 (1995)","journal-title":"Trans. Autom. Control"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-15155-2_31","volume-title":"Mathematical Foundations of Computer Science 2010","author":"E Filiot","year":"2010","unstructured":"Filiot, E., Le Gall, T., Raskin, J.-F.: Iterated regret minimization in game graphs. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 342\u2013354. Springer, Heidelberg (2010)"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 190\u2013204. Springer, Heidelberg (2010)"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.geb.2011.05.012","volume":"74","author":"JY Halpern","year":"2012","unstructured":"Halpern, J.Y., Pass, R.: Iterated regret minimization: a new solution concept. Games Econ. Behav. 74(1), 184\u2013207 (2012)","journal-title":"Games Econ. Behav."},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11874683_26","volume-title":"Computer Science Logic","author":"TA Henzinger","year":"2006","unstructured":"Henzinger, T.A., Piterman, N.: Solving games without determinization. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 395\u2013410. Springer, Heidelberg (2006)"},{"key":"1_CR32","unstructured":"Hunter, P., P\u00e9rez, G.A., Raskin, J.-F.: Reactive synthesis without regret. In: Proceedings of CONCUR. LIPIcs, vol. 42, pp. 114\u2013127. Schloss Dagstuhl - LZI (2015)"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","volume":"43","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Rudolf, G., Zhao, J.: On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput. Syst. 43, 204\u2013233 (2008)","journal-title":"Theory Comput. Syst."},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-319-17130-2_15","volume-title":"Multi-Agent Systems","author":"O Kupferman","year":"2015","unstructured":"Kupferman, O., Perelli, G., Vardi, M.Y.: Synthesis with rational environments. In: Bulling, N. (ed.) EUMAS 2014. LNCS, vol. 8953, pp. 219\u2013235. Springer, Heidelberg (2015)"},{"key":"1_CR35","unstructured":"Mannor, S., Tsitsiklis, J.: Mean-variance optimization in Markov decision processes. In: Proceedings of ICML, pp. 177\u2013184. Omnipress (2011)"},{"key":"1_CR36","unstructured":"Mogavero, F., Murano, A., Vardi, M.Y.: Reasoning about strategies. In: Proceedings of FSTTCS, LIPIcs, vol. 8, pp. 133\u2013144. Schloss Dagstuhl - LZI (2010)"},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in \n                      \n                        \n                      \n                      $$n$$\n                      \n                        \n                          n\n                        \n                      \n                    -person games. PNAS 36, 48\u201349 (1950)","journal-title":"PNAS"},{"key":"1_CR38","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"M Puterman","year":"1994","unstructured":"Puterman, M.: Markov decision processes: discrete stochastic dynamic programming, 1st edn. Wiley, New York (1994)","edition":"1"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"J-P Queille","year":"1982","unstructured":"Queille, J.-P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) International Symposium on Programming. LNCS, vol. 137, pp. 337\u2013351. Springer, Heidelberg (1982)"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-21690-4_8","volume-title":"Computer Aided Verification","author":"M Randour","year":"2015","unstructured":"Randour, M., Raskin, J.-F., Sankur, O.: Percentile queries in multi-dimensional Markov decision processes. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 123\u2013139. Springer, Heidelberg (2015)"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","first-page":"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)"},{"key":"1_CR42","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)"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: Proceedings of FOCS, pp. 327\u2013338. IEEE (1985)","DOI":"10.1109\/SFCS.1985.12"},{"issue":"1","key":"1_CR44","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jmaa.1998.6203","volume":"231","author":"C Wu","year":"1999","unstructured":"Wu, C., Lin, Y.: Minimizing risk models in Markov decision processes with policies depending on target values. J. Math. Anal. Appl. 231(1), 47\u201367 (1999)","journal-title":"J. Math. Anal. Appl."},{"key":"1_CR45","unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Proceedings of NIPS, pp. 905\u2013912 (2008)"},{"issue":"1","key":"1_CR46","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 158(1), 343\u2013359 (1996)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:23:20Z","timestamp":1558311800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"26 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}