{"series_title":"Lecture Notes in Computer Science","oa_version":"Preprint","volume":8172,"type":"conference","year":"2013","date_updated":"2023-02-23T12:22:51Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2279","status":"public","title":"Looking at mean-payoff and total-payoff through windows","project":[{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, 8172 (2013) 118–132.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and total-payoff through windows. 8172, 118–132.","mla":"Chatterjee, Krishnendu, et al. <i>Looking at Mean-Payoff and Total-Payoff through Windows</i>. Vol. 8172, Springer, 2013, pp. 118–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">10.1007/978-3-319-02444-8_10</a>.","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.","apa":"Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. <a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">https://doi.org/10.1007/978-3-319-02444-8_10</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">https://doi.org/10.1007/978-3-319-02444-8_10</a>.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. 2013;8172:118-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">10.1007/978-3-319-02444-8_10</a>"},"language":[{"iso":"eng"}],"conference":{"start_date":"2013-10-15","end_date":"2013-10-18","name":"ATVA: Automated Technology for Verification and Analysis","location":"Hanoi, Vietnam"},"doi":"10.1007/978-3-319-02444-8_10","date_created":"2018-12-11T11:56:44Z","date_published":"2013-01-01T00:00:00Z","day":"01","publication_status":"published","page":"118 - 132","related_material":{"record":[{"relation":"later_version","id":"523","status":"public"}]},"publist_id":"4656","publisher":"Springer","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"department":[{"_id":"KrCh"}],"month":"01","alternative_title":["LNCS"],"acknowledgement":"279307; ERC; Fonds National de la Reserche Luxembourg;  279499; ERC; Fonds National de la Reserche Luxembourg","intvolume":"      8172","scopus_import":1,"quality_controlled":"1","oa":1,"ec_funded":1,"abstract":[{"text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.4248"}]}