Recommendations
Cited in
(23)- Dependences in strategy logic
- On subgame perfect equilibria in turn-based reachability timed games
- A game-theoretic approach for the synthesis of complex systems
- Synthesis with rational environments
- Dependences in strategy logic
- The Complexity of Synthesis from Probabilistic Components
- Rational synthesis
- The complexity of rational synthesis for concurrent games
- Nash equilibria in games over graphs equipped with a communication mechanism
- The complexity of subgame perfect equilibria in quantitative reachability games
- scientific article; zbMATH DE number 7649921 (Why is no real title available?)
- On the complexity of rational verification
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words
- The complexity of LTL rational synthesis
- Stackelberg-Pareto synthesis
- The complexity of LTL rational synthesis
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
- Arena-independent memory bounds for Nash equilibria in reachability games
- The adversarial Stackelberg value in quantitative games
- As soon as possible but rationally
- Arena-independent memory bounds for Nash equilibria in reachability games
- Games with trading of control
- Verification with common knowledge of rationality for graph games
This page was built for publication: The complexity of rational synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598263)
