Pages that link to "Item:Q800838"
From MaRDI portal
The following pages link to The complexity of two-player games of incomplete information (Q800838):
Displayed 22 items.
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation (Q434470) (← links)
- Information tracking in games on graphs (Q616037) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Turing machines with access to history (Q751802) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← 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)
- Probabilistic game automata (Q1824400) (← links)
- Polynomial games and determinacy (Q1919550) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← 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)
- Strategy Construction for Parity Games with Imperfect Information (Q3541028) (← links)
- Computing Weakest Strategies for Safety Games of Imperfect Information (Q3617754) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- On Decision Problems for Probabilistic Büchi Automata (Q5458366) (← links)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)