{"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","location":"Budapest, Hungary","start_date":"2014-08-25","end_date":"2014-08-29"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider two-player zero-sum partial-observation stochastic games on graphs. Based on the information available to the players these games can be classified as follows: (a) general 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) perfect-observation (both players have complete view of the game). The one-sided partial-observation games subsumes the important special case of one-player partial-observation stochastic games (or partial-observation Markov decision processes (POMDPs)). Based on the randomization available for the strategies, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all ω-regular objectives. The analysis problems are classified into the qualitative analysis that asks for the existence of a strategy that ensures the objective with probability 1; and the quantitative analysis that asks for the existence of a strategy that ensures the objective with probability at least λ (0,1). In this talk we will cover a wide range of results: for perfect-observation games; for POMDPs; for one-sided partial-observation games; and for general partial-observation games."}],"date_updated":"2023-02-23T12:23:43Z","ec_funded":1,"publication_status":"published","publisher":"Springer","intvolume":"      8634","title":"Partial-observation stochastic reachability and parity games","date_published":"2014-01-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:54:38Z","issue":"PART 1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","year":"2014","month":"01","related_material":{"record":[{"status":"public","relation":"later_version","id":"2211"},{"status":"public","relation":"earlier_version","id":"5381"}]},"_id":"1903","day":"01","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"pubrep_id":"141","doi":"10.1007/978-3-662-44522-8_1","citation":{"ista":"Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.","ama":"Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:<a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">10.1007/978-3-662-44522-8_1</a>","ieee":"K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.","mla":"Chatterjee, Krishnendu. <i>Partial-Observation Stochastic Reachability and Parity Games</i>. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:<a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">10.1007/978-3-662-44522-8_1</a>.","chicago":"Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">https://doi.org/10.1007/978-3-662-44522-8_1</a>.","short":"K. Chatterjee, in:, Springer, 2014, pp. 1–4.","apa":"Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">https://doi.org/10.1007/978-3-662-44522-8_1</a>"},"page":"1 - 4","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"volume":8634,"scopus_import":1,"alternative_title":["LNCS"],"department":[{"_id":"KrCh"}],"type":"conference","publist_id":"5192","status":"public"}