Strategy Construction for Parity Games with Imperfect Information

DOI10.1007/978-3-540-85361-9_27zbMath1160.68455OpenAlexW2147830304MaRDI QIDQ3541028

Krishnendu Chatterjee, Sangram Raje, Dietmar Berwanger, Laurent Doyen, Thomas A. Henzinger

Publication date: 25 November 2008

Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.7407

Mathematics Subject Classification ID

Games involving graphs (91A43) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Mean-payoff games with partial observation ⋮ Strategy Construction for Parity Games with Imperfect Information ⋮ Modal and mixed specifications: key decision problems and their complexities ⋮ Computing Weakest Strategies for Safety Games of Imperfect Information

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Automata, logics, and infinite games. A guide to current research
• Strategy Construction for Parity Games with Imperfect Information
• On the synthesis of strategies in infinite games
• Algorithms for Omega-Regular Games with Imperfect Information
• Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
• Antichains: A New Algorithm for Checking Universality of Finite Automata