A survey of partial-observation stochastic parity games
Publication:2248075
DOI10.1007/s10703-012-0164-2zbMath1291.91022OpenAlexW2057554513MaRDI QIDQ2248075
Thomas A. Henzinger, Krishnendu Chatterjee, Laurent Doyen
Publication date: 30 June 2014
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://repository.ist.ac.at/303/1/Survey_Partial-Observation_Stochastic_Parity_Games.pdf
2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Stochastic games, stochastic differential games (91A15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Number of quantifiers is better than number of tape cells
- The complexity of stochastic games
- Infinite games played on finite graphs
- Fair simulation
- Partial-Observation Stochastic Games: How to Win When Belief Fails
- Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds
- On the expressiveness and complexity of randomization in finite state monitors
- Alternating-time temporal logic
- Randomness for Free
- Qualitative Analysis of Partially-Observable Markov Decision Processes
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
- Qualitative Concurrent Stochastic Games with Imperfect Information
- The determinacy of Blackwell games
- The Complexity of Partial-Observation Parity Games
- Computer Science Logic
- Algorithms for Omega-Regular Games with Imperfect Information
- On Decision Problems for Probabilistic Büchi Automata
- Solving Sequential Conditions by Finite-State Strategies
- Power of Randomization in Automata on Infinite Strings