一元不动点逻辑中的社会选择与博弈推理
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
摘要：
无论是在范式博弈中，还是在公平分配中，或者在投票系统中的选民偏好中，某种推理模式都是常见的。从一个特定的配置文件，一个代理或一组代理可能有动机转移到一个新的。这导致了一个自然的图结构，我们称之为改进图的策略空间的这些系统。我们建议，一元不动点逻辑计数，一元一阶逻辑的扩展图上的不动点和计数量词，是一个自然的规约语言的改进图，因此，为一类属性，可以解释这些领域。该逻辑具有有效的模型检验算法（在改进图的大小上）。
英文摘要：
Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a new one. This induces a natural graph structure that we call the improvement graph on the strategy space of these systems. We suggest that the monadic fixed-point logic with counting, an extension of monadic first-order logic on graphs with fixed-point and counting quantifiers, is a natural specification language on improvement graphs, and thus for a class of properties that can be interpreted across these domains. The logic has an efficient model checking algorithm (in the size of the improvement graph).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
