软约束和图形博弈中最优性概念的比较
A comparison of the notions of optimality in soft constraints and graphical games
摘要：
最优性的概念自然地出现在与决策有关的应用数学和计算机科学的许多领域。在这里，我们认为这一概念的背景下，用于不同目的和不同的研究领域的两个形式主义：图形游戏和软约束。我们涉及的软约束满足问题（SCSP）中使用的图形游戏中使用的最优性的概念，显示了一个大类的SCSP，包括加权约束的每一个最优解对应于一个纳什均衡，这也是一个帕累托有效的联合策略。
英文摘要：
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of two formalisms used for different purposes and in different research areas: graphical games and soft constraints. We relate the notion of optimality used in the area of soft constraint satisfaction problems (SCSPs) to that used in graphical games, showing that for a large class of SCSPs that includes weighted constraints every optimal solution corresponds to a Nash equilibrium that is also a Pareto efficient joint strategy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
