Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete

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

doi:10.1007/978-3-031-45286-4_6

Lecture Notes in Computer Science

2023

DOI: 10.1007/978-3-031-45286-4_6

|View full text |Cite

Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete

Thomas Brihaye,

Véronique Bruyère,

Gaspard Reghem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Stackelberg-Pareto Synthesis

Bruyère,

Fievet,

Raskin

et al. 2024

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

We study the framework of two-player Stackelberg games played on graphs in which Player 0 announces a strategy and Player 1 responds rationally with a strategy that is an optimal response. While it is usually assumed that Player 1 has a single objective, we consider here the new setting where he has several. In this context, after responding with his strategy, Player 1 gets a payoff in the form of a vector of Booleans corresponding to his satisfied objectives. Rationality of Player 1 is encoded by the fact that his response must produce a Pareto-optimal payoff given the strategy of Player 0. We study for several kinds of ω -regular objectives the Stackelberg-Pareto Synthesis problem which asks whether Player 0 can announce a strategy which satisfies his objective, whatever the rational response of Player 1. We show that this problem is fixed-parameter tractable for games in which objectives are all reachability, safety, Büchi, co-Büchi, Boolean Büchi, parity, Muller, Streett or Rabin objectives. We also show that this problem is \(\mathsf {NEXPTIME} \) -complete except for the cases of Büchi objectives for which it is \(\mathsf {NP} \) -complete and co-Büchi objectives for which it is in \(\mathsf {NEXPTIME} \) and \(\mathsf {NP} \) -hard. The problem is already \(\mathsf {NP} \) -complete in the simple case of reachability objectives and graphs that are trees.

show abstract

Stackelberg-Pareto Synthesis

Bruyère,

Fievet,

Raskin

et al. 2024

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete

Cited by 1 publication

References 31 publications

Stackelberg-Pareto Synthesis

Stackelberg-Pareto Synthesis

Contact Info

Product

Resources

About