### VIP内容

Tristan Charrier，博士。 研究领域：符号模型，认知计划，用于指定认知情况的语言，认知推理的证明。

François Schwarzentruber是法国雷恩（ENS Rennes）副教授。 他目前的研究兴趣主要集中在逻辑理论及其在人工智能，代理和多代理系统以及计算机科学中的应用。 他曾是Synthese，Studia Logica和Theoretical Computer Science等期刊的审稿人。 自2011年以来，他的研究主要致力于研究动态认知逻辑。

slide简介：

• 介绍
• 知识与seeing
• 知识与时间
• 动态认知逻辑
• 基于知识的项目
• 总结

### 最新论文

We investigate the following many-to-one stable matching problem with diversity constraints (SMTI-Diverse): Given a set of students and a set of colleges which have preferences over each other, where the students have overlapping types, and the colleges each have a total capacity as well as quotas for individual types (the diversity constraints), is there a matching satisfying all diversity constraints such that no unmatched student-college pair has an incentive to deviate? SMTI-Diverse is known to be NP-hard. However, as opposed to the NP-membership claims in the literature [Aziz et al., AAMAS 2019; Huang, SODA 2010], we prove that it is beyond NP: it is complete for the complexity class $\Sigma^{\text{P}}_2$. In addition, we provide a comprehensive analysis of the problem's complexity from the viewpoint of natural restrictions to inputs and obtain new algorithms for the problem.

Top