Partial-Observation Stochastic Games: How to Win When Belief Fails

DOI10.1109/LICS.2012.28zbMath1362.91008arXiv1107.2141OpenAlexW1987738956MaRDI QIDQ2986794

Krishnendu Chatterjee, Laurent Doyen

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2141

zbMATH Keywords

complexityreachabilitystochastic gamesmemory boundsBüchi objectivespartial-observation gamesalmost-sure winningpositive winning

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

A partially observable stochastic zero-sum game for a network epidemic control problem ⋮ Graph Games and Reactive Synthesis ⋮ Mean-payoff games with partial observation ⋮ On almost-sure intention deception planning that exploits imperfect observers ⋮ A survey of partial-observation stochastic parity games ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes

This page was built for publication: Partial-Observation Stochastic Games: How to Win When Belief Fails