The complexity of subgame perfect equilibria in quantitative reachability games
From MaRDI portal
Publication:5140263
Recommendations
Cites work
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 6862070 (Why is no real title available?)
- scientific article; zbMATH DE number 6767615 (Why is no real title available?)
- Admissibility in Infinite Games
- Assume-admissible synthesis
- Computer aided synthesis: a game-theoretic approach
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
- Deterministic multi-player Dynkin games.
- Equilibrium points in n -person games
- Games with secure equilibria
- Multiplayer cost games with simple Nash equilibria
- On the existence of weak subgame perfect equilibria
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- Rational synthesis
- Rational synthesis under imperfect information
- Reasoning about strategies
- Solution concepts and algorithms for infinite multiplayer games
- Strategy logic
- Subgame perfection for equilibria in quantitative reachability games
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Synthesis with rational environments
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- The Complexity of Nash Equilibria in Limit-Average Games
- The complexity of admissibility in omega-regular games
- The complexity of rational synthesis
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
- scientific article; zbMATH DE number 6767615 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7649921 (Why is no real title available?)
- 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)
