Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908525749338112 |
|---|---|
| author | Brihaye, Thomas Bruyère, Véronique Reghem, Gaspard |
| author_facet | Brihaye, Thomas Bruyère, Véronique Reghem, Gaspard |
| contents | In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player $0$ announces a strategy and Player $1$, having several objectives, responds rationally by following plays providing him Pareto-optimal payoffs given the strategy of Player $0$. The Stackelberg-Pareto synthesis problem, asking whether Player $0$ can announce a strategy which satisfies his objective, whatever the rational response of Player $1$, has been recently investigated for $ω$-regular objectives. We solve this problem for weighted graph games and quantitative reachability objectives such that Player $0$ wants to reach his target set with a total cost less than some given upper bound. We show that it is NEXPTIME-complete, as for Boolean reachability objectives. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_09443 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives Brihaye, Thomas Bruyère, Véronique Reghem, Gaspard Computer Science and Game Theory In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player $0$ announces a strategy and Player $1$, having several objectives, responds rationally by following plays providing him Pareto-optimal payoffs given the strategy of Player $0$. The Stackelberg-Pareto synthesis problem, asking whether Player $0$ can announce a strategy which satisfies his objective, whatever the rational response of Player $1$, has been recently investigated for $ω$-regular objectives. We solve this problem for weighted graph games and quantitative reachability objectives such that Player $0$ wants to reach his target set with a total cost less than some given upper bound. We show that it is NEXPTIME-complete, as for Boolean reachability objectives. |
| title | Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2308.09443 |