Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete (Q6623016)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete |
scientific article; zbMATH DE number 7930575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete |
scientific article; zbMATH DE number 7930575 |
Statements
Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete (English)
0 references
23 October 2024
0 references
two-player Stackelberg games played on graphs
0 references
strategy synthesis
0 references
quantitative reachability objectives
0 references
Pareto-optimal costs
0 references
0 references
0 references
