{"title":"The complexity of partial-observation parity games","publist_id":"2323","article_processing_charge":"No","page":"1 - 14","volume":6397,"oa_version":"Submitted Version","month":"12","file":[{"file_id":"7872","file_size":142836,"creator":"dernst","relation":"main_file","checksum":"770e86e5d78c56fddb4786a8da7ef126","date_updated":"2020-07-14T12:46:18Z","file_name":"2010_LPAR_Chatterjee.pdf","access_level":"open_access","content_type":"application/pdf","date_created":"2020-05-19T16:29:04Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_published":"2010-12-09T00:00:00Z","has_accepted_license":"1","abstract":[{"text":"We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have com- plete view of the game). We survey the complexity results for the problem of de- ciding the winner in various classes of partial-observation games with ω-regular winning conditions specified as parity objectives. We present a reduction from the class of parity objectives that depend on sequence of states of the game to the sub-class of parity objectives that only depend on the sequence of observations. We also establish that partial-observation acyclic games are PSPACE-complete.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:52:43Z","intvolume":"      6397","scopus_import":1,"publisher":"Springer","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"department":[{"_id":"KrCh"}],"conference":{"end_date":"2010-10-15","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Yogyakarta, Indonesia","start_date":"2010-10-10"},"_id":"3858","doi":"10.1007/978-3-642-16242-8_1","alternative_title":["LNCS"],"ddc":["000"],"date_created":"2018-12-11T12:05:33Z","file_date_updated":"2020-07-14T12:46:18Z","citation":{"ieee":"K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.","ista":"Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>The Complexity of Partial-Observation Parity Games</i>. Vol. 6397, Springer, 2010, pp. 1–14, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,” 6397:1–14. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.","ama":"Chatterjee K, Doyen L. The complexity of partial-observation parity games. In: Vol 6397. Springer; 2010:1-14. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>"},"status":"public","day":"09","oa":1,"quality_controlled":"1","publication_status":"published","year":"2010"}