arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.11044cs.LO
收藏

基于层次模型的偏好推理的计算与复杂性

Computation and Complexity of Preference Inference Based on Hierarchical Models

Nic Wilson, Anne-Marie George, Barry O'Sullivan

AI总结:

本文研究基于层次字典序模型的偏好推理问题,证明其一般情况为coNP完全,全序准则或固定等价类下存在高效多项式算法。

摘要:

偏好推理指基于对用户偏好关系形式的假设,从已获取或观察到的偏好中推断出额外的用户偏好。本文研究这样一种场景:备选方案对应一个成本向量,每个分量对应不同的准则,且备选方案的比较采用一种字典序,与层次约束逻辑编程(Hierarchical Constraint Logic Programming)模型中备选方案的比较方式类似。我们假设用户对准则存在某种(未知的)重要性排序,比较两个备选方案时,首先比较各方案在最重要准则上的综合成本;仅当这些综合成本相等时,才考虑次重要的准则。此时偏好推理问题就是判断能否从一组输入偏好中推导出某个偏好陈述。我们证明该问题是coNP完全的,即便将等重要性集合的基数限制为至多两个元素,且仅考虑非严格偏好,这一结论依然成立。但如果假设用户的准则排序是全序,该问题可在多项式时间内求解;若所有等重要准则集合都是某个给定固定等价关系的等价类,问题同样是多项式可解的。我们针对这些情况给出了一种高效的多项式算法,该算法也揭示了推理的结构特性。

英文摘要:

Preference Inference involves inferring additional user preferences from elicited or observed preferences, based on assumptions regarding the form of the user's preference relation. In this paper we consider a situation in which alternatives have an associated vector of costs, each component corresponding to a different criterion, and are compared using a kind of lexicographic order, similar to the way alternatives are compared in a Hierarchical Constraint Logic Programming model. It is assumed that the user has some (unknown) importance ordering on criteria, and that to compare two alternatives, firstly, the combined cost of each alternative with respect to the most important criteria are compared; only if these combined costs are equal, are the next most important criteria considered. The preference inference problem then consists of determining whether a preference statement can be inferred from a set of input preferences. We show that this problem is coNP-complete, even if one restricts the cardinality of the equal-importance sets to have at most two elements, and one only considers non-strict preferences. However, it is polynomial if it is assumed that the user's ordering of criteria is a total ordering; it is also polynomial if the sets of equally important criteria are all equivalence classes of a given fixed equivalence relation. We give an efficient polynomial algorithm for these cases, which also throws light on the structure of the inference.

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

↑