Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
Abstract
In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player announces a strategy and Player , having several objectives, responds rationally by following plays providing him Pareto-optimal payoffs given the strategy of Player . The Stackelberg-Pareto synthesis problem, asking whether Player can announce a strategy which satisfies his objective, whatever the rational response of Player , has been recently investigated for -regular objectives. We solve this problem for weighted graph games and quantitative reachability objectives such that Player 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.
Keywords
Cite
@article{arxiv.2308.09443,
title = {Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives},
author = {Thomas Brihaye and Véronique Bruyère and Gaspard Reghem},
journal= {arXiv preprint arXiv:2308.09443},
year = {2025}
}