A game-theoretic approach for the synthesis of complex systems
From MaRDI portal
Publication:2104251
DOI10.1007/978-3-031-08740-0_5OpenAlexW4285200096MaRDI QIDQ2104251
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis with rational environments
- Assume-admissible synthesis
- Doomsday equilibria for omega-regular games
- Games with secure equilibria
- Strategy logic
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Automata, logics, and infinite games. A guide to current research
- Automata on infinite trees
- Computer aided synthesis: a game-theoretic approach
- Non-Zero Sum Games for Reactive Synthesis
- Existence of Secure Equilibrium in Multi-player Games with Perfect Information
- Quantitative languages
- Reasoning About Strategies
- The Complexity of Nash Equilibria in Limit-Average Games
- Admissible Strategies in Infinite Games over Graphs
- Multiplayer Cost Games with Simple Nash Equilibria
- Rational Synthesis
- Admissibility in Infinite Games
- Existence and Characterization of Perfect Equilibrium in Games of Perfect Information
- A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information
- The Complexity of Rational Synthesis
- The complexity of admissibility in Omega-regular games
- Secure equilibria in weighted games
- The Target Discounted-Sum Problem
- Admissiblity in Concurrent Games
- Computer Science Logic
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- Equilibrium points in n -person games
- On relevant equilibria in reachability games
This page was built for publication: A game-theoretic approach for the synthesis of complex systems
