arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.03765cs.AI
收藏

图聚合

Graph Aggregation

ILLC, University of Amsterdam(阿姆斯特丹大学逻辑、语言与计算研究所);IRIT, University of Toulouse(图卢兹大学信息与电信研究所);University of Toulouse(图卢兹大学);Paris-Dauphine University(巴黎第九大学);Pierre & Marie Curie University(皮埃尔和玛丽·居里大学);London School of Economics(伦敦政治经济学院)

Ulle Endriss, Umberto Grandi

摘要:

图聚合是计算单个输出图的过程,该输出图构成了多个输入图之间的良好折衷,每个输入图由不同的源提供。人们需要在各种各样的情况下执行图聚合,例如,当应用投票规则时(图作为偏好顺序),当合并关于辩论中的论点之间的关系的冲突观点时(图作为抽象论证框架),或者当计算给定数据集的几个备选聚类之间的共识时(图作为等价关系)。在本文中,我们介绍了一个正式的框架,基于社会选择理论的图聚合。我们的重点是理解由各个输入图共享的哪些属性将转移到由给定聚合规则返回的输出图。我们考虑图的共同属性,如传递性和自反性,以及在模态逻辑的某些片段中可表达的任意属性。我们的研究结果建立了几个连接下保持聚合和选择理论公理所使用的规则所满足的属性类型之间。这些结果中最重要的是一个强大的不可能性定理,概括阿罗的开创性的结果聚集的偏好顺序到一个大集合的不同类型的图形。

英文摘要:

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding the relationships between arguments in a debate (graphs as abstract argumentation frameworks), or when computing a consensus between several alternative clusterings of a given dataset (graphs as equivalence relations). In this paper, we introduce a formal framework for graph aggregation grounded in social choice theory. Our focus is on understanding which properties shared by the individual input graphs will transfer to the output graph returned by a given aggregation rule. We consider both common properties of graphs, such as transitivity and reflexivity, and arbitrary properties expressible in certain fragments of modal logic. Our results establish several connections between the types of properties preserved under aggregation and the choice-theoretic axioms satisfied by the rules used. The most important of these results is a powerful impossibility theorem that generalises Arrow's seminal result for the aggregation of preference orders to a large collection of different types of graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑