Positional-player games
From MaRDI portal
Cites work
- A Hierarchy of Nondeterminism
- Adapting to the behavior of environments with bounded memory
- Algorithmic Game Theory
- An Antichain Algorithm for LTL Realizability
- Automata-theoretic techniques for modal logics of programs
- Borel determinacy
- Bounded Synthesis
- Characterizing positionality in games of infinite duration over infinite graphs
- Computer Aided Verification
- Computer Science Logic
- CONCUR 2005 – Concurrency Theory
- Conditionally Optimal Algorithms for Generalized B\"uchi Games
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Formal Analysis of Online Algorithms
- Games with trading of control
- Half-Positional Determinacy of Infinite Games
- Half-positional objectives recognized by deterministic Büchi automata
- How to play optimally for regular objectives?
- scientific article; zbMATH DE number 3930354 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 3084669 (Why is no real title available?)
- scientific article; zbMATH DE number 7830368 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Mathematical Foundations of Computer Science 2005
- Minimising good-for-games automata is NP-complete
- Minimization and canonization of GFG transition-based automata
- Number of quantifiers is better than number of tape cells
- On the (in)succinctness of Muller automata
- On the menbership problem for functional and multivalued dependencies in relational databases
- On the positional determinacy of edge-labeled games
- On the synthesis of strategies in infinite games
- Positional -regular languages
- Positionality in ^0_2 and a completeness result
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Rational synthesis
- Reactive Synthesis Without Regret
- Simple strategies in multi-objective MDPs
- Solving partial-information stochastic parity games
- STACS 2004
- Supervisory Control for Opacity
- Temporal synthesis for bounded systems and environments
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- The complexity of rational synthesis
- The directed subgraph homeomorphism problem
- Width of non-deterministic automata
- Zielonka DAG acceptance and regular languages over infinite words
This page was built for publication: Positional-player games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310239)
