Pages that link to "Item:Q800838"
From MaRDI portal
The following pages link to The complexity of two-player games of incomplete information (Q800838):
Displaying 42 items.
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- The complexity of synchronous notions of information flow security (Q278742) (← links)
- Model-checking games for logics of imperfect information (Q391101) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation (Q434470) (← links)
- The complexity of debate checking (Q493647) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Information tracking in games on graphs (Q616037) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- The complexity of asynchronous model based testing (Q714798) (← links)
- Turing machines with access to history (Q751802) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Randomness for free (Q897644) (← links)
- Alternating-time stream logic for multi-agent systems (Q967523) (← links)
- Solitaire automata (Q1058475) (← links)
- Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Compositional and symbolic synthesis of reactive controllers for multi-agent systems (Q1641032) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- Probabilistic game automata (Q1824400) (← links)
- Polynomial games and determinacy (Q1919550) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← links)
- Time-aware uniformization of winning strategies (Q2106605) (← links)
- Knowledge-based strategies for multi-agent teams playing against nature (Q2152496) (← links)
- Cooperating in video games? Impossible! Undecidability of team multiplayer games (Q2196560) (← links)
- Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control (Q2231651) (← links)
- POMDPs under probabilistic semantics (Q2344358) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Compositional construction of most general controllers (Q2350495) (← links)
- Quantum alternation (Q2361668) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- Observation and distinction: representing information in infinite games (Q2701064) (← links)
- THE COMPLEXITY OF COVERAGE (Q2841992) (← links)
- Lazy Synthesis (Q2891413) (← links)
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking (Q2901208) (← links)
- A Compositional Framework for Controller Synthesis (Q3090853) (← links)
- Minimum Attention Controller Synthesis for Omega-Regular Objectives (Q3172849) (← links)
- (Q5075766) (← links)
- Game-based Synthesis of Distributed Controllers for Sampled Switched Systems (Q5240151) (← links)
