{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:28:15Z","timestamp":1762522095544,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,10,11]],"date-time":"2017-10-11T00:00:00Z","timestamp":1507680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00236-017-0304-7","type":"journal-article","created":{"date-parts":[[2017,10,11]],"date-time":"2017-10-11T07:31:06Z","timestamp":1507707066000},"page":"627-647","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Looking at mean payoff through foggy windows"],"prefix":"10.1007","volume":"55","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":[[2017,10,11]]},"reference":[{"key":"304_CR1","doi-asserted-by":"crossref","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s decidable about weighted automata? In: ATVA, pp. 482\u2013491. Springer (2011)","DOI":"10.1007\/978-3-642-24372-1_37"},{"key":"304_CR2","doi-asserted-by":"crossref","unstructured":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., Henzinger, T.A.: Alpaga: a tool for solving parity games with imperfect information. In: TACAS, volume 5505 of LNCS. Springer (2009)","DOI":"10.1007\/978-3-642-00768-2_7"},{"issue":"1","key":"304_CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0304-3975(03)00427-4","volume":"310","author":"H Bj\u00f6rklund","year":"2004","unstructured":"Bj\u00f6rklund, H., Sandberg, S., Vorobyov, S.: Memoryless determinacy of parity and mean payoff games: a simple proof. TCS 310(1), 365\u2013378 (2004)","journal-title":"TCS"},{"key":"304_CR4","doi-asserted-by":"crossref","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Jin, N., Raskin, J.F.: Acacia+, a tool for LTL synthesis. In: CAV, pp. 652\u2013657. Springer (2012)","DOI":"10.1007\/978-3-642-31424-7_45"},{"issue":"2","key":"304_CR5","first-page":"97","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. FMSD 38(2), 97\u2013118 (2011)","journal-title":"FMSD"},{"key":"304_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: EMSOFT, volume 2855 of LNCS. Springer (2003)","DOI":"10.1007\/978-3-540-45212-6_9"},{"key":"304_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L.: The complexity of partial-observation parity games. In: LPAR, pp. 1\u201314. Springer (2010)","DOI":"10.1007\/978-3-642-16242-8_1"},{"key":"304_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A, Raskin, J.F.: Algorithms for omega-regular games with imperfect information. In: CSL, pp. 287\u2013302 (2006)","DOI":"10.1007\/11874683_19"},{"key":"304_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Randour, M., Raskin, J.F.: Looking at mean-payoff and total-payoff through windows. In: ATVA, pp. 118\u2013132. Springer (2013)","DOI":"10.1007\/978-3-319-02444-8_10"},{"key":"304_CR10","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":"304_CR11","doi-asserted-by":"publisher","unstructured":"Doyen, L., Raskin, J.F.: Antichains for the automata-based approach to model-checking. LMCS 5(1) (2009). doi: 10.2168\/LMCS-5(1:5)2009","DOI":"10.2168\/LMCS-5(1:5)2009"},{"key":"304_CR12","doi-asserted-by":"crossref","unstructured":"Doyen, L., Raskin, J.F.: Antichain algorithms for finite automata. In TACAS, volume 6015 of LNCS, pp. 2\u201322. Springer (2010)","DOI":"10.1007\/978-3-642-12002-2_2"},{"key":"304_CR13","doi-asserted-by":"crossref","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":"304_CR14","unstructured":"Allen Emerson, E., Jutla, Charanjit S.: Tree automata, mu-calculus and determinacy (extended abstract). In: STOCS, pp. 368\u2013377. IEEE (1991)"},{"issue":"7","key":"304_CR15","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.ipl.2014.02.010","volume":"114","author":"R Gentilini","year":"2014","unstructured":"Gentilini, R.: A note on the approximation of mean-payoff games. IPL 114(7), 382\u2013386 (2014)","journal-title":"IPL"},{"key":"304_CR16","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E.: Positional determinacy of infinite games. In: STACS, pp. 4\u201318. Springer (2004)","DOI":"10.1007\/978-3-540-24749-4_2"},{"key":"304_CR17","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: STACS, volume 1770 of LNCS, pp. 290\u2013301. Springer (2000)","DOI":"10.1007\/3-540-46541-3_24"},{"key":"304_CR18","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"},{"issue":"2","key":"304_CR19","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"JH Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. J. Comput Syst. Sci. 29(2), 274\u2013301 (1984)","journal-title":"J. Comput Syst. Sci."},{"key":"304_CR20","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of $$\\omega $$ \u03c9 -automata. In: FOCS, pp. 319\u2013327. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"304_CR21","doi-asserted-by":"crossref","unstructured":"Safra, S.: Exponential determinization for omega-automata with strong-fairness acceptance condition (extended abstract). In: STOC, pp. 275\u2013282 (1992)","DOI":"10.1145\/129712.129739"},{"key":"304_CR22","doi-asserted-by":"crossref","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: STACS, pp. 1\u201313. Springer (1995)","DOI":"10.1007\/3-540-59042-0_57"},{"issue":"1","key":"304_CR23","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. TCS 158(1), 343\u2013359 (1996)","journal-title":"TCS"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-017-0304-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0304-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0304-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T09:15:38Z","timestamp":1570180538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-017-0304-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,11]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s00236-017-0304-7","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2017,10,11]]}}}