尽快但理性地
As Soon as Possible but Rationally
AI总结：
本文研究加权图多玩家博弈中理性验证与综合的复杂性，系统预先声明策略，环境玩家按纳什均衡或帕累托最优成本元组理性响应。
摘要：
本文研究在加权图上进行的多玩家博弈中理性验证与综合的复杂性问题，其中每个玩家的目标是最小化到达特定目标顶点集合的成本。在这些博弈中，一个被称为“系统”的玩家预先声明其策略。组成环境的其他玩家随后根据各自目标理性地采取行动。这些响应玩家的理性行为通过两种模型来刻画：他们选择的策略要么构成纳什均衡，要么导致具有帕累托最优成本元组的博弈过程。
英文摘要：
This paper addresses complexity problems in rational verification and synthesis for multi-player games played on weighted graphs, where the objective of each player is to minimize the cost of reaching a specific set of target vertices. In these games, one player, referred to as the system, declares his strategy upfront. The other players, composing the environment, then rationally make their moves according to their objectives. The rational behavior of these responding players is captured through two models: they opt for strategies that either represent a Nash equilibrium or lead to a play with a Pareto-optimal cost tuple.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
