The complexity of subgame perfect equilibria in quantitative reachability games
From MaRDI portal
Publication:5140263
Authors: Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Marie van den Bogaard, Jean-François Raskin 
Publication date: 15 December 2020
Full work available at URL: https://arxiv.org/abs/1905.00784
Recommendations
subgame perfect equilibriaconstrained existence problemmultiplayer non-zero-sum games played on graphsquantitative reachability objectives
Cites Work
- Equilibrium points in n -person games
- Deterministic multi-player Dynkin games.
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Reasoning about strategies
- Synthesis with rational environments
- Rational synthesis
- Title not available (Why is that?)
- The complexity of rational synthesis
- Rational synthesis under imperfect information
- Assume-admissible synthesis
- Subgame perfection for equilibria in quantitative reachability games
- The Complexity of Nash Equilibria in Limit-Average Games
- Games with secure equilibria
- Strategy logic
- Multiplayer cost games with simple Nash equilibria
- Admissibility in Infinite Games
- The complexity of admissibility in omega-regular games
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- Computer aided synthesis: a game-theoretic approach
- Solution concepts and algorithms for infinite multiplayer games
- Title not available (Why is that?)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
- On the existence of weak subgame perfect equilibria
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- Title not available (Why is that?)
Cited In (11)
- Subgame perfect implementation: a full characterization
- A game-theoretic approach for the synthesis of complex systems
- On subgame perfect equilibria in turn-based reachability timed games
- Title not available (Why is that?)
- Subgame-perfect Equilibria in Mean-payoff Games (journal version)
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
- Title not available (Why is that?)
- Stackelberg-Pareto synthesis
- Subgame perfection for equilibria in quantitative reachability games
This page was built for publication: The complexity of subgame perfect equilibria in quantitative reachability games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140263)
