Combining Qualitative and Quantitative Reasoning for Logic-based Games

结合基于逻辑的游戏的定性和定量推理

• 批准号: EP/M009130/1
• 负责人: Michael Wooldridge
• 金额: $ 34.57万
• 依托单位: University of Oxford
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2014
• 资助国家: 英国
• 起止时间: 2014 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FM009130%2F1
• 关键词: Combining; Qualitative; Quantitative; Reasoning; Logic

The use of game theoretic techniques in computer science is becoming ever more prevalent. One reason for this is that in many of the systems we want to build, participants cannot be assumed to be benevolent: instead, they must be assumed to be rational agents, acting in pursuit of their own personal goals. For such systems, game theory provides a natural analytical framework. In our work, we are interested in the automated analysis of such systems using techniques for model checking, which over the past two decades have proved to be enormously influential. In model checking, the idea is to express desirable system properties as logical formula, and then to check whether these properties actually hold of the given system. A key problem if we want to extend existing verification techniques to game theoretic settings is that the formalisms used in model checking do not allow us to directly represent the preferences or utilities of players (i.e., their goals). This project is directed at this problem. The basic idea is that we can use a formalism known as Lukasiewicz logic to express the "utility function" for players, which represent their preferences. Lukasiewicz logic is a non-classical, multiple-valued logic which has the attractive property that Lukasiewicz formulae can represent a very rich class of utility functions -- much richer than is possible using classical logic. The project will lay the theoretical groundwork for this new and exciting class of logically-specified games, and has the potential to greatly enrich the class of systems for which logic-based automated analysis techniques can be applied.

博弈论技术在计算机科学中的使用变得越来越普遍。原因之一是，在我们想要构建的许多系统中，不能假设参与者是仁慈的：相反，必须假设他们是理性的代理人，为追求自己的个人目标而行动。对于这样的系统，博弈论提供了一个自然的分析框架。在我们的工作中，我们对使用模型检查技术对此类系统进行自动分析感兴趣，这些技术在过去的二十年中已被证明具有巨大的影响力。在模型检查中，其思想是将所需的系统属性表达为逻辑公式，然后检查这些属性是否确实适用于给定系统。如果我们想将现有的验证技术扩展到博弈论设置，一个关键问题是模型检查中使用的形式主义不允许我们直接表示玩家的偏好或效用（即他们的目标）。这个项目就是针对这个问题的。基本思想是，我们可以使用一种称为卢卡谢维奇逻辑的形式主义来表达玩家的“效用函数”，代表他们的偏好。 Lukasiewicz 逻辑是一种非经典的多值逻辑，其具有吸引人的特性，即 Lukasiewicz 公式可以表示非常丰富的效用函数类 - 比使用经典逻辑所能表示的要丰富得多。该项目将为这一类新的、令人兴奋的逻辑指定游戏奠定理论基础，并有可能极大地丰富可应用基于逻辑的自动分析技术的系统类别。

项目成果

On Deductive Interpolation for the Weak Nilpotent Minimum logic

弱幂极小值逻辑的演绎插值

• DOI: 10.1016/j.fss.2015.12.016
• 发表时间: 2016
• 期刊: Fuzzy Sets and Systems
• 影响因子: 3.9
• 作者: Marchioni E

Lukasiewicz logics for cooperative games

合作博弈的 Lukasiewicz 逻辑

• DOI: 10.1016/j.artint.2019.03.003
• 发表时间: 2019
• 期刊: Artificial Intelligence
• 影响因子: 14.4
• 作者: Marchioni E

Lukasiewicz Games A Logic-Based Approach to Quantitative Strategic Interactions

Lukasiewicz Games 基于逻辑的定量战略互动方法

• DOI: 10.1145/2783436
• 发表时间: 2015
• 期刊: ACM Transactions on Computational Logic
• 影响因子: 0.5
• 作者: Marchioni E

Lukasiewicz Games

卢卡谢维奇游戏

• 发表时间: 2014
• 作者: E. Marchioni