Optimal strategy synthesis for request-response games
From MaRDI portal
Publication:3465629
DOI10.1051/ita/2015005zbMath1347.68206arXiv1406.4648OpenAlexW2198629034MaRDI QIDQ3465629
Wolfgang Thomas, Nico Wallmeier, Martín G. Zimmermann, Florian Horn
Publication date: 22 January 2016
Published in: RAIRO - Theoretical Informatics and Applications, Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.4648
2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80) Formal languages and automata (68Q45) Games involving topology, set theory, or logic (91A44)
Related Items (6)
Multiplayer Cost Games with Simple Nash Equilibria ⋮ On equilibria in quantitative games with reachability/safety objectives ⋮ Down the Borel hierarchy: solving Muller games via safety games ⋮ A delayed promotion policy for parity games ⋮ Optimizing Winning Strategies in Regular Infinite Games ⋮ Time-Optimal Winning Strategies for Poset Games
Cites Work
- Unnamed Item
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- Automata, logics, and infinite games. A guide to current research
- Parametric temporal logic for “model measuring”
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games
- On the synthesis of strategies in infinite games
- Hybrid Systems: Computation and Control
- From Liveness to Promptness
- Mathematical Foundations of Computer Science 2005
- Solving Sequential Conditions by Finite-State Strategies
- Faster Algorithms for Finitary Games
- CONCUR 2005 – Concurrency Theory
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Optimal strategy synthesis for request-response games
