{"project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"status":"public","ddc":["000"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:43Z","oa":1,"department":[{"_id":"KrCh"}],"citation":{"mla":"Chatterjee, Krishnendu, and Nir Piterman. <i>Combinations of Qualitative Winning for Stochastic Parity Games</i>. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">10.4230/LIPICS.CONCUR.2019.6</a>.","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">10.4230/LIPICS.CONCUR.2019.6</a>","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">https://doi.org/10.4230/LIPICS.CONCUR.2019.6</a>.","apa":"Chatterjee, K., &#38; Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">https://doi.org/10.4230/LIPICS.CONCUR.2019.6</a>"},"date_created":"2019-09-18T08:11:43Z","month":"08","conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Amsterdam, Netherlands","end_date":"2019-08-30","start_date":"2019-08-27"},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"doi":"10.4230/LIPICS.CONCUR.2019.6","_id":"6889","alternative_title":["LIPIcs"],"publication_status":"published","article_number":"6","abstract":[{"lang":"eng","text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. "}],"volume":140,"date_updated":"2021-01-12T08:09:28Z","type":"conference","has_accepted_license":"1","year":"2019","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","date_published":"2019-08-01T00:00:00Z","license":"https://creativecommons.org/licenses/by/4.0/","title":"Combinations of Qualitative Winning for Stochastic Parity Games","quality_controlled":"1","scopus_import":1,"oa_version":"Published Version","intvolume":"       140","file":[{"access_level":"open_access","relation":"main_file","file_name":"2019_LIPIcs_Chatterjee.pdf","date_created":"2019-10-01T08:49:45Z","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","creator":"kschuh","file_id":"6923","date_updated":"2020-07-14T12:47:43Z","content_type":"application/pdf","file_size":509163}],"language":[{"iso":"eng"}]}