统一了投票权与重要性度量的理论框架，可推广至多领域。
The Sets of Power
- 基于单调递增谓词划分子集，通用化重要性度量方法。
- 证明可在任意参考集上计算经典重要性指标。
- 为数据库、论证分析等新领域提供度量设计思路。
自20世纪40年代以来，投票权度量一直是研究热点。近年来，类似的重要性度量被应用于不一致知识库、论证中的攻击强度、数据库管理分析以及可解释性等多个领域。本文表明，这些实例均可视为更广泛问题域中重要性度量的具体表现。论文进一步证明，只要给定一个单调递增的谓词来划分参考集的子集，即可计算出最著名的各种重要性度量。由此推导出，在若干此前尚未研究或未提出度量的领域中，也可设计相应的度量方法。此外，本文还指出了若干与重要性度量计算相关的研究方向。
原文摘要 · Abstract (English)
Measures of voting power have been the subject of extensive research since the mid 1940s. More recently, similar measures of relative importance have been studied in other domains that include inconsistent knowledge bases, intensity of attacks in argumentation, different problems in the analysis of database management, and explainability. This paper demonstrates that all these examples are instantiations of computing measures of importance for a rather more general problem domain. The paper then shows that the best-known measures of importance can be computed for any reference set whenever one is given a monotonically increasing predicate that partitions the subsets of that reference set. As a consequence, the paper also proves that measures of importance can be devised in several domains, for some of which such measures have not yet been studied nor proposed. Furthermore, the paper highlights several research directions related with computing measures of importance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。