Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete.
Thomas BrihayeVéronique BruyèreGaspard ReghemPublished in: RP (2023)
Keyphrases
- pspace complete
- multi objective
- np complete
- quantitative and qualitative
- multi objective optimization
- satisfiability problem
- upper bound
- evolutionary algorithm
- website
- state space
- differential evolution
- game theory
- qualitative and quantitative
- cooperative
- genetic algorithm
- data sets
- case study
- multiobjective optimization