Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete

DOI10.1007/978-3-031-45286-4_6MaRDI QIDQ6623016

Thomas Brihaye, Véronique Bruyère, Gaspard Reghem

Publication date: 23 October 2024

zbMATH Keywords

strategy synthesisquantitative reachability objectivestwo-player Stackelberg games played on graphsPareto-optimal costs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis with rational environments
• Games with secure equilibria
• Automata, logics, and infinite games. A guide to current research
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Mean-payoff games with \(\omega\)-regular specifications
• Non-Zero Sum Games for Reactive Synthesis
• The Complexity of Nash Equilibria in Limit-Average Games
• Graph Games and Reactive Synthesis
• Rational Synthesis
• Admissibility in Infinite Games
• A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information
• The Complexity of Rational Synthesis
• Assume-Admissible Synthesis
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Assume-Guarantee Synthesis
• Equilibrium points in n -person games
• On the Complexity of SPEs in Parity Games
• The complexity of LTL rational synthesis
• The complexity of SPEs in mean-payoff games
• Pareto-rational verification

This page was built for publication: Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete