{"date_published":"2011-04-16T00:00:00Z","editor":[{"last_name":"Owe","first_name":"Olaf","full_name":"Owe, Olaf"},{"last_name":"Steffen","full_name":"Steffen, Martin","first_name":"Martin"},{"first_name":"Jan Arne","full_name":"Telle, Jan Arne","last_name":"Telle"}],"day":"16","year":"2011","publisher":"Springer","language":[{"iso":"eng"}],"intvolume":"      6914","publist_id":"3270","oa_version":"Submitted Version","quality_controlled":"1","scopus_import":1,"title":"On memoryless quantitative objectives","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3211"}],"month":"04","date_created":"2018-12-11T12:02:50Z","citation":{"ieee":"K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.","short":"K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.","ama":"Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In: Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:<a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">10.1007/978-3-642-22953-4_13</a>","mla":"Chatterjee, Krishnendu, et al. <i>On Memoryless Quantitative Objectives</i>. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">10.1007/978-3-642-22953-4_13</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, &#38; J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">https://doi.org/10.1007/978-3-642-22953-4_13</a>","ista":"Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">https://doi.org/10.1007/978-3-642-22953-4_13</a>."},"department":[{"_id":"KrCh"}],"oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"148 - 159","type":"conference","date_updated":"2021-01-12T07:42:52Z","volume":6914,"abstract":[{"lang":"eng","text":"In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Besides their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist. In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This new class contains both the limit-average and the discounted sum functions, and we show that they are the only members of this class which induce memoryless optimal strategies, showing that there is essentially no other simple payoff functions."}],"publication_status":"published","alternative_title":["LNCS"],"_id":"3351","conference":{"end_date":"2011-08-25","start_date":"2011-08-22","name":"FCT: Fundamentals of Computation Theory","location":"Oslo, Norway"},"doi":"10.1007/978-3-642-22953-4_13","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}]}