Information tracking in games on graphs

DOI10.1007/s10849-009-9115-8zbMath1203.91033OpenAlexW2003386597MaRDI QIDQ616037

Łukasz Kaiser, Dietmar Berwanger

Publication date: 7 January 2011

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-009-9115-8

zbMATH Keywords

infinite gamesimperfect informationmultiplayer gamesdistributed strategies

Mathematics Subject Classification ID

Games involving graphs (91A43) (n)-person games, (n>2) (91A06)

Related Items

Hierarchical information and the synthesis of distributed strategies, Consensus Game Acceptors, Knowledge-based strategies for multi-agent teams playing against nature, Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus, Consensus Game Acceptors and Iterated Transductions, Infinite games with finite knowledge gaps, Approximate verification of strategic abilities under imperfect information, Distributed Synthesis in Continuous Time, Uniform strategies, rational relations and jumping automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Distributed synthesis for well-connected architectures
• Infinite games played on finite graphs
• The infimal prefix-closed and observable superlanguage of a given language
• Undecidable problems of decentralized observation and control on regular languages
• Algorithms for Omega-Regular Games with Imperfect Information
• Supervisory Control of a Class of Discrete Event Processes
• Alternation
• Think globally, act locally: decentralized supervisory control
• On the synthesis of strategies in infinite games