Information tracking in games on graphs
From MaRDI portal
Publication:616037
Recommendations
Cites work
- Algorithms for Omega-Regular Games with Imperfect Information
- Alternation
- Distributed synthesis for well-connected architectures
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 3078993 (Why is no real title available?)
- Infinite games played on finite graphs
- Nondeterministic controllers of nondeterministic processes
- On the synthesis of strategies in infinite games
- Supervisory Control of a Class of Discrete Event Processes
- The complexity of two-player games of incomplete information
- The infimal prefix-closed and observable superlanguage of a given language
- Think globally, act locally: decentralized supervisory control
- Undecidable problems of decentralized observation and control on regular languages
Cited in
(15)- Hierarchical information and the synthesis of distributed strategies
- Games on graphs with a public signal monitoring
- Knowledge-based strategies for multi-agent teams playing against nature
- Approximate verification of strategic abilities under imperfect information
- Uniform strategies, rational relations and jumping automata
- Distributed synthesis in continuous time
- Relating paths in transition systems: the fall of the modal mu-calculus
- Stochastic Dynamic Information Flow Tracking Game with Reinforcement Learning
- Consensus game acceptors
- scientific article; zbMATH DE number 2038773 (Why is no real title available?)
- Consensus game acceptors and iterated transductions
- Games with recurring certainty
- Infinite games with finite knowledge gaps
- Information flows and memory in games
- Model-checking strategic abilities in information-sharing systems
This page was built for publication: Information tracking in games on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616037)
