A game-theoretic approach for the synthesis of complex systems

DOI10.1007/978-3-031-08740-0_5MaRDI QIDQ2104251zbMATH OpenOpenAlexFDO

Authors Véronique Bruyère

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-08740-0_5

zbMATH Keywords

computer-aided synthesisgames played on graphssolution concepts

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Graph Games and Reactive Synthesis
• Computer aided synthesis: a game-theoretic approach
• The complexity of rational synthesis for concurrent games
• On the synthesis of strategies in infinite games
• Non-zero sum games for reactive synthesis

Cites work

• A characterization of subgame-perfect equilibrium plays in Borel games of perfect information
• A course in game theory.
• Admissibility in Infinite Games
• Admissible Strategies in Infinite Games over Graphs
• Admissiblity in concurrent games
• Assume-admissible synthesis
• Automata on infinite trees
• Automata, logics, and infinite games. A guide to current research
• Computer aided synthesis: a game-theoretic approach
• Computer Science Logic
• Constrained existence problem for weak subgame perfect equilibria with -regular Boolean objectives
• Equilibrium points in n -person games
• Existence and Characterization of Perfect Equilibrium in Games of Perfect Information
• Existence of secure equilibrium in multi-player games with perfect information
• Games with secure equilibria
• scientific article; zbMATH DE number 1134975 (Why is no real title available?)
• scientific article; zbMATH DE number 7005721 (Why is no real title available?)
• scientific article; zbMATH DE number 6862070 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• scientific article; zbMATH DE number 7730629 (Why is no real title available?)
• scientific article; zbMATH DE number 7730610 (Why is no real title available?)
• scientific article; zbMATH DE number 7730611 (Why is no real title available?)
• Making the best of limited memory in multi-player discounted sum games
• Multiplayer cost games with simple Nash equilibria
• Non-zero sum games for reactive synthesis
• Quantitative languages
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Rational synthesis
• Reasoning about strategies: on the model-checking problem
• Secure equilibria in weighted games
• Solution concepts and algorithms for infinite multiplayer games
• Strategy logic
• Subgame-perfect equilibria of finite- and infinite-horizon games
• Synthesis with rational environments
• The complexity of admissibility in omega-regular games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• The Complexity of Nash Equilibria in Limit-Average Games
• The complexity of rational synthesis
• The complexity of subgame perfect equilibria in quantitative reachability games
• The target discounted-sum problem

Cited in

(4)

• Games of constraints for complex systems
• A Game-Theoretic Approach to Simulation of Data-Parameterized Systems
• scientific article; zbMATH DE number 1900858 (Why is no real title available?)
• Games with trading of control

This page was built for publication: A game-theoretic approach for the synthesis of complex systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104251)