Stackelberg-Pareto 综合与定量可达性目标
Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
AI总结：
本文研究加权图上的两人 Stackelberg-Pareto 综合问题，针对定量可达性目标，证明其 NEXPTIME 完全性。
摘要：
在本文中，我们深化了对图上两人 Stackelberg 博弈的研究，其中玩家 0 宣布一个策略，而玩家 1 拥有多个目标，他通过遵循在玩家 0 的策略下为其提供帕累托最优收益的路径来理性地做出反应。Stackelberg-Pareto 综合问题询问玩家 0 是否可以宣布一个策略，无论玩家 1 的理性反应如何，该策略都能满足他自己的目标，该问题最近已针对 ω-正则目标进行了研究。我们解决了加权图博弈和定量可达性目标的问题，其中玩家 0 希望以总成本低于某个给定上限的方式到达其目标集合。我们证明该问题是 NEXPTIME 完全的，与布尔可达性目标的情况一样。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
