The complexity of two-player games of incomplete information
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3723925 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- A Combinatorial Problem Which Is Complete in Polynomial Space
- Alternation
- Decision algorithms for multiplayer noncooperative games of incomplete information
- GO Is Polynomial-Space Hard
- On the Computational Complexity of Algorithms
- On the complexity of some two-person perfect-information games
- Provably Difficult Combinatorial Games
- Relationships between nondeterministic and deterministic tape complexities
- Space-bounded reducibility among combinatorial problems
- The polynomial-time hierarchy
Cited in
(68)- Minimum Attention Controller Synthesis for Omega-Regular Objectives
- Connectivity games over dynamic networks
- Information tracking in games on graphs
- A general notion of uniform strategies
- scientific article; zbMATH DE number 7455737 (Why is no real title available?)
- scientific article; zbMATH DE number 7104930 (Why is no real title available?)
- Uniform strategies, rational relations and jumping automata
- The complexity of pursuit on a graph
- Time-aware uniformization of winning strategies
- Alternating-time stream logic for multi-agent systems
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
- GIB: Imperfect information in a computationally challenging game
- scientific article; zbMATH DE number 7525466 (Why is no real title available?)
- Probabilistic game automata
- Robust almost-sure reachability in multi-environment MDPs
- The complexity of synchronous notions of information flow security
- A compositional framework for controller synthesis
- On Decision Problems for Probabilistic Büchi Automata
- Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control
- Looking at mean payoff through foggy windows
- The complexity of asynchronous model based testing
- Compositional construction of most general controllers
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Lower bounds for multiplayer noncooperative games of incomplete information
- Computing Weakest Strategies for Safety Games of Imperfect Information
- Compositional and symbolic synthesis of reactive controllers for multi-agent systems
- Quantum alternation
- Model-checking games for logics of imperfect information
- The complexity of Scotland Yard
- Stochastic games with synchronization objectives
- Multi-oracle interactive protocols with constant space verifiers
- Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games
- Knowledge-based strategies for multi-agent teams playing against nature
- Perspective games with notifications
- Strategy Construction for Parity Games with Imperfect Information
- scientific article; zbMATH DE number 2086402 (Why is no real title available?)
- Turing machines with access to history
- Randomness for free
- Lazy synthesis
- Mean-payoff games with partial observation
- Alternating-time temporal logic
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
- Synthesis with privacy against an observer
- POMDPs under probabilistic semantics
- Common knowledge and update in finite environments
- Games with Symmetric Incomplete Information and Asymmetric Computational Resources
- Regular games with imperfect information are not that regular
- Solitaire automata
- Latticed-LTL synthesis in the presence of noisy inputs
- scientific article; zbMATH DE number 1559566 (Why is no real title available?)
- scientific article; zbMATH DE number 4176870 (Why is no real title available?)
- Stochastic games with synchronizing objectives
- The complexity of debate checking
- Synthesis with privacy against an observer
- The complexity of coverage
- Classifying the computational complexity of problems
- Perspective games
- Strategy construction for parity games with imperfect information
- A formal approach to attack graphs
- Partial-observation stochastic games, how to win when belief fails
- Cooperating in video games? Impossible! Undecidability of team multiplayer games
- Observation and distinction: representing information in infinite games
- Polynomial games and determinacy
- Decision algorithms for multiplayer noncooperative games of incomplete information
- Computation of equilibria in noncooperative games
- Game-based Synthesis of Distributed Controllers for Sampled Switched Systems
- BOCoSy: Small but Powerful Symbolic Output-Feedback Control
- Infinite games with finite knowledge gaps
This page was built for publication: The complexity of two-player games of incomplete information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800838)
