Infinite games with finite knowledge gaps

DOI10.1016/j.ic.2016.10.009zbMath1371.91020arXiv1411.5820OpenAlexW1890835473WikidataQ110742642 ScholiaQ110742642MaRDI QIDQ528188

Dietmar Berwanger, Anup Basil Mathew

Publication date: 12 May 2017

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

infinite gamesgames on graphscoordinationimperfect informationdistributed synthesis

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Information tracking in games on graphs
• The complexity of two-player games of incomplete information
• Distributed synthesis for well-connected architectures
• The complexity of reasoning about knowledge and time. I: Lower bounds
• Space-bounded reducibility among combinatorial problems
• Agreeing to disagree
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Reasoning about infinite computations
• Context-sensitive string languages and recognizable picture languages
• Recognizable picture languages and domino tiling
• Automata, logics, and infinite games. A guide to current research
• A Perfect-Information Construction for Coordination in Games
• Distributed synthesis for acyclic architectures
• Consensus Game Acceptors
• Alternating-time temporal logic
• Hierarchical Information Patterns and Distributed Strategy Synthesis
• Knowledge and common knowledge in a distributed environment
• Infinite Coordination Games
• Coordination Logic
• Game Quantification on Automatic Structures and Hierarchical Model Checking Games
• On the synthesis of strategies in infinite games
• On the (High) Undecidability of Distributed Synthesis Problems
• Some Results on Tape-Bounded Turing Machines
• The Complexity of Decentralized Control of Markov Decision Processes
• Lower bounds for multiplayer noncooperative games of incomplete information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item