{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T20:59:40Z","timestamp":1768337980773,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T00:00:00Z","timestamp":1461715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T00:00:00Z","timestamp":1461715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ERC Starting grant","award":["279499"],"award-info":[{"award-number":["279499"]}]},{"name":"F.R.S.-FNRS Aspirant"},{"name":"ERC Starting grant","award":["279499"],"award-info":[{"award-number":["279499"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00236-016-0268-z","type":"journal-article","created":{"date-parts":[[2016,4,28]],"date-time":"2016-04-28T16:15:05Z","timestamp":1461860105000},"page":"3-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Reactive synthesis without regret"],"prefix":"10.1007","volume":"54","author":[{"given":"Paul","family":"Hunter","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1200-4952","authenticated-orcid":false,"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,27]]},"reference":[{"key":"268_CR1","doi-asserted-by":"crossref","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Reasoning about online algorithms with weighted automata. ACM Transactions on Algorithms (2010)","DOI":"10.1137\/1.9781611973068.91"},{"key":"268_CR2","doi-asserted-by":"crossref","unstructured":"Aminof, B., Rubin, S.: First cycle games. In: SR, pp. 83\u201390 (2014)","DOI":"10.4204\/EPTCS.146.11"},{"issue":"5","key":"268_CR3","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/opre.30.5.961","volume":"30","author":"DE Bell","year":"1982","unstructured":"Bell, D.E.: Regret in decision making under uncertainty. Oper. Res. 30(5), 961\u2013981 (1982)","journal-title":"Oper. Res."},{"issue":"3\u20134","key":"268_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00236-013-0191-5","volume":"51","author":"R Bloem","year":"2014","unstructured":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T.A., Hofferek, G., Jobstmann, B., K\u00f6nighofer, B., K\u00f6nighofer, R.: Synthesizing robust systems. Acta Inf. 51(3\u20134), 193\u2013220 (2014)","journal-title":"Acta Inf."},{"key":"268_CR5","doi-asserted-by":"publisher","unstructured":"Boker, U., Henzinger, TA.: Exact and approximate determinization of discounted-sum automata. LMCS 10(1) (2014). doi:10.2168\/LMCS-10(1:10)2014","DOI":"10.2168\/LMCS-10(1:10)2014"},{"issue":"2","key":"268_CR6","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. Form. Methods Syst. Des. 38(2), 97\u2013118 (2011)","journal-title":"Form. Methods Syst. Des."},{"key":"268_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: EMSOFT, volume 2855 of LNCS, pp. 117\u2013133. Springer (2003)","DOI":"10.1007\/978-3-540-45212-6_9"},{"key":"268_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Filiot, E., Raskin, JF.: Doomsday equilibria for omega-regular games. In: VMCAI, vol. 8318, pp. 78\u201397. Springer (2014)","DOI":"10.1007\/978-3-642-54013-4_5"},{"key":"268_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, TA.: Quantitative languages. ACM Transactions on Computational Logic 11(4), 1\u201338 (2010)","DOI":"10.1145\/1805950.1805953"},{"key":"268_CR10","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: FSTTCS, pp. 505\u2013516 (2010)"},{"key":"268_CR11","doi-asserted-by":"crossref","unstructured":"Damm, W., Finkbeiner, B.: Does it pay to extend the perimeter of a world model? In: FM, volume 6664 of LNCS, pp. 12\u201326. Springer (2011)","DOI":"10.1007\/978-3-642-21437-0_4"},{"key":"268_CR12","doi-asserted-by":"crossref","unstructured":"Degorre, A., Doyen, L., Gentilini, R., Raskin, J.-F., Toru\u0144czyk, S.: Energy and mean-payoff games with imperfect information. In: CSL, pp. 260\u2013274 (2010)","DOI":"10.1007\/978-3-642-15205-4_22"},{"key":"268_CR13","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: LICS of IEEE computer society, pp. 99\u2013110 (1997)","DOI":"10.1109\/LICS.1997.614939"},{"key":"268_CR14","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"},{"issue":"2","key":"268_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-218X(97)00121-2","volume":"85","author":"T Eilam-Tzoreff","year":"1998","unstructured":"Eilam-Tzoreff, T.: The disjoint shortest paths problem. Discrete Appl. Math. 85(2), 113\u2013138 (1998)","journal-title":"Discrete Appl. Math."},{"key":"268_CR16","doi-asserted-by":"crossref","unstructured":"Filiot, E., Le Gall, T., Raskin, J.-F.: Iterated regret minimization in game graphs. In: MFCS, volume 6281 of LNCS, pp. 342\u2013354. Springer (2010)","DOI":"10.1007\/978-3-642-15155-2_31"},{"key":"268_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"1","key":"268_CR18","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":"268_CR19","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Piterman, N.: Solving games without determinization. In CSL, pp. 395\u2013410 (2006)","DOI":"10.1007\/11874683_26"},{"key":"268_CR20","doi-asserted-by":"crossref","unstructured":"Hunter, P., P\u00e9rez G.A., Raskin, J.-F.: Mean-payoff games with partial-observation-(extended abstract). In: Reachability Problems, pp. 163\u2013175 (2014)","DOI":"10.1007\/978-3-319-11439-2_13"},{"issue":"3","key":"268_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in $${\\sf UP} \\cup {\\sf coUP}$$. IPL 68(3), 119\u2013124 (1998)","journal-title":"IPL"},{"key":"268_CR22","doi-asserted-by":"publisher","unstructured":"Jurdzinski, M., Sproston, J., Laroussinie, F.: Model checking probabilistic timed automata with one or two clocks. LMCS 4(3) (2008). doi:10.2168\/LMCS-4(3:12)2008","DOI":"10.2168\/LMCS-4(3:12)2008"},{"issue":"1","key":"268_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. TCS 84(1), 127\u2013150 (1991)","journal-title":"TCS"},{"key":"268_CR24","doi-asserted-by":"publisher","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. LMCS 3(3) (2007). doi:10.2168\/LMCS-3(3:5)2007","DOI":"10.2168\/LMCS-3(3:5)2007"},{"key":"268_CR25","doi-asserted-by":"crossref","unstructured":"Piterman, N., Pnueli, A.: Faster solutions of Rabin and Streett games. In: LICS, pp. 275\u2013284 (2006)","DOI":"10.1109\/LICS.2006.23"},{"key":"268_CR26","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"key":"268_CR27","doi-asserted-by":"crossref","unstructured":"Wen, M., Ehlers, R., Topcu, U.: Correct-by-synthesis reinforcement learning with temporal logic constraints. In: IEEE of IROS, pp. 4983\u20134990 (2015)","DOI":"10.1109\/IROS.2015.7354078"},{"key":"268_CR28","unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: NIPS, pp. 905\u2013912 (2008)"},{"issue":"1","key":"268_CR29","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. TCS 158(1), 343\u2013359 (1996)","journal-title":"TCS"}],"updated-by":[{"DOI":"10.1007\/s00236-021-00410-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000}}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0268-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-016-0268-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0268-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0268-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:32:16Z","timestamp":1748903536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-016-0268-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,27]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["268"],"URL":"https:\/\/doi.org\/10.1007\/s00236-016-0268-z","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,27]]},"assertion":[{"value":"29 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2021","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00236-021-00410-0","URL":"https:\/\/doi.org\/10.1007\/s00236-021-00410-0","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}