{"date_published":"2013-09-12T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-12T11:39:10Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file":[{"file_size":300481,"date_created":"2018-12-12T11:53:16Z","checksum":"226bc791124f8d3138379778ce834e86","content_type":"application/pdf","file_id":"5477","file_name":"IST-2013-141-v1+1_main-tech-rpt.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:46Z","relation":"main_file","creator":"system"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"full_name":"Nain, Sumit","first_name":"Sumit","last_name":"Nain"},{"last_name":"Vardi","full_name":"Vardi, Moshe","first_name":"Moshe"}],"day":"12","publication_status":"published","pubrep_id":"141","doi":"10.15479/AT:IST-2013-141-v1-1","publisher":"IST Austria","title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","abstract":[{"lang":"eng","text":"We consider two-player partial-observation stochastic games where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are omega-regular conditions specified as parity objectives. The qualitative analysis problem given a partial-observation stochastic game and a parity objective asks whether  there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, they were shown to be decidable in 2EXPTIME under finite-memory  strategies. We improve the complexity and show that the qualitative analysis problems for partial-observation stochastic parity games under finite-memory strategies are \r\nEXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis. "}],"_id":"5408","file_date_updated":"2020-07-14T12:46:46Z","date_updated":"2023-02-23T10:33:11Z","type":"technical_report","department":[{"_id":"KrCh"}],"related_material":{"record":[{"id":"2213","status":"public","relation":"later_version"}]},"ddc":["000","005"],"status":"public","month":"09","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","year":"2013","alternative_title":["IST Austria Technical Report"],"citation":{"ieee":"K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, <i>The complexity of partial-observation stochastic parity games with finite-memory strategies</i>. IST Austria, 2013.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">10.15479/AT:IST-2013-141-v1-1</a>.","ista":"Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation stochastic parity games with finite-memory strategies, IST Austria, 17p.","ama":"Chatterjee K, Doyen L, Nain S, Vardi M. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">10.15479/AT:IST-2013-141-v1-1</a>","apa":"Chatterjee, K., Doyen, L., Nain, S., &#38; Vardi, M. (2013). <i>The complexity of partial-observation stochastic parity games with finite-memory strategies</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">https://doi.org/10.15479/AT:IST-2013-141-v1-1</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">https://doi.org/10.15479/AT:IST-2013-141-v1-1</a>.","short":"K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013."},"page":"17","oa_version":"Published Version"}