The Complexity of Partial-Observation Parity Games

DOI10.1007/978-3-642-16242-8_1zbMath1298.91050OpenAlexW1527706278MaRDI QIDQ4933292

Krishnendu Chatterjee, Laurent Doyen

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Looking at mean payoff through foggy windows ⋮ Graph Games and Reactive Synthesis ⋮ Mean-payoff games with partial observation ⋮ Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus ⋮ A survey of partial-observation stochastic parity games ⋮ Partial-Observation Stochastic Games ⋮ Compositional construction of most general controllers

This page was built for publication: The Complexity of Partial-Observation Parity Games