{"file":[{"file_size":329976,"content_type":"application/pdf","checksum":"824d6c70e6d3feb3e836b009e0b3cf73","date_created":"2018-12-12T11:52:57Z","file_id":"5458","access_level":"open_access","file_name":"IST-2011-0001_IST-2011-0001.pdf","date_updated":"2020-07-14T12:46:41Z","relation":"main_file","creator":"system"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:02Z","date_published":"2011-02-16T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2023-02-23T11:23:11Z","file_date_updated":"2020-07-14T12:46:41Z","_id":"5387","abstract":[{"lang":"eng","text":"We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives. In system design, the parity objective is used to encode ω-regular specifications, and the mean-payoff and energy objectives can be used to model quantitative resource constraints. The energy condition re- quires that the resource level never drops below 0, and the mean-payoff condi- tion requires that the limit-average value of the resource consumption is within a threshold. While these two (energy and mean-payoff) classical conditions are equivalent for two-player games, we show that they differ for MDPs. We show that the problem of deciding whether a state is almost-sure winning (i.e., winning with probability 1) in energy parity MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable in polynomial time, improving a recent PSPACE bound."}],"title":"Energy and mean-payoff parity Markov decision processes","publisher":"IST Austria","doi":"10.15479/AT:IST-2011-0001","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"pubrep_id":"23","publication_status":"published","day":"16","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"month":"02","status":"public","related_material":{"record":[{"id":"3345","status":"public","relation":"later_version"}]},"ddc":["000","005"],"type":"technical_report","department":[{"_id":"KrCh"}],"oa_version":"Published Version","page":"20","citation":{"ieee":"K. Chatterjee and L. Doyen, <i>Energy and mean-payoff parity Markov decision processes</i>. IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">10.15479/AT:IST-2011-0001</a>.","ama":"Chatterjee K, Doyen L. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">10.15479/AT:IST-2011-0001</a>","ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Energy and mean-payoff parity Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">https://doi.org/10.15479/AT:IST-2011-0001</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">https://doi.org/10.15479/AT:IST-2011-0001</a>.","short":"K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011."},"alternative_title":["IST Austria Technical Report"],"year":"2011"}