Partial-observation stochastic reachability and parity games

DOI10.1007/978-3-662-44522-8_1zbMATH Open1425.68140OpenAlexW169296402MaRDI QIDQ2921997FDOQ2921997

Authors: Krishnendu Chatterjee 

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_1

Recommendations

• A survey of partial-observation stochastic parity games
• Partial-observation stochastic games: how to win when belief fails
• Partial-observation stochastic games, how to win when belief fails
• The complexity of partial-observation stochastic parity games with finite-memory strategies
• Solving partial-information stochastic parity games

zbMATH Keywords

stochastic gamesparity gamessurvey articlereachability games

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43)

Cited In (5)

• Title not available (Why is that?)
• Equivalence of games with probabilistic uncertainty and partial-observation games
• Qualitative analysis of partially-observable Markov decision processes
• The complexity of partial-observation parity games
• A survey of partial-observation stochastic parity games

This page was built for publication: Partial-observation stochastic reachability and parity games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921997)