scientific article; zbMATH DE number 7285575
From MaRDI portal
Publication:5140263
Marie van den Bogaard, Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
Publication date: 15 December 2020
Full work available at URL: https://arxiv.org/abs/1905.00784
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
subgame perfect equilibriaconstrained existence problemmultiplayer non-zero-sum games played on graphsquantitative reachability objectives
Related Items (3)
On subgame perfect equilibria in turn-based reachability timed games ⋮ On relevant equilibria in reachability games ⋮ A game-theoretic approach for the synthesis of complex systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis with rational environments
- Games with secure equilibria
- Strategy logic
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Deterministic multi-player Dynkin games.
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
- Computer aided synthesis: a game-theoretic approach
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- On the Existence of Weak Subgame Perfect Equilibria
- The Complexity of Nash Equilibria in Limit-Average Games
- Multiplayer Cost Games with Simple Nash Equilibria
- Rational Synthesis
- Admissibility in Infinite Games
- The Complexity of Rational Synthesis
- The complexity of admissibility in Omega-regular games
- Rational Synthesis Under Imperfect Information
- Assume-Admissible Synthesis
- 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:
