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

DOI10.1007/978-3-031-45286-4_6MaRDI QIDQ6623016zbMATH OpenFDO

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

Publication date 23 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-45286-4_6

zbMATH Keywords

Pareto-optimal costsquantitative reachability objectivesstrategy synthesistwo-player Stackelberg games played on graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A characterization of subgame-perfect equilibrium plays in Borel games of perfect information
• A course in game theory.
• Admissibility in Infinite Games
• Assume-admissible synthesis
• Assume-Guarantee Synthesis
• Automata, logics, and infinite games. A guide to current research
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Equilibrium points in n -person games
• Games with secure equilibria
• Graph Games and Reactive Synthesis
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• scientific article; zbMATH DE number 7730629 (Why is no real title available?)
• scientific article; zbMATH DE number 7730610 (Why is no real title available?)
• scientific article; zbMATH DE number 7730611 (Why is no real title available?)
• Making the best of limited memory in multi-player discounted sum games
• Mean-payoff games with \(\omega\)-regular specifications
• Model checking
• Non-zero sum games for reactive synthesis
• On the Complexity of SPEs in Parity Games
• Pareto-rational verification
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Rational synthesis
• Solution concepts and algorithms for infinite multiplayer games
• Synthesis with rational environments
• The complexity of LTL rational synthesis
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• The Complexity of Nash Equilibria in Limit-Average Games
• The complexity of rational synthesis
• The complexity of SPEs in mean-payoff games
• The complexity of subgame perfect equilibria in quantitative reachability games

Cited in

(2)

• As soon as possible but rationally
• The non-cooperative rational synthesis problem for SPEs and -regular objectives

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623016)