Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting

Aggregating preferences over combinatorial domains has many applications in artificial intelligence (AI). Given the inherent exponential nature of preferences over combinatorial domains, compact representation languages are needed to represent them, and (m)CP-nets are among the most studied ones. Se...

全面介绍

书目详细资料
Main Authors: Lukasiewicz, T, Malizia, E
格式: Journal article
语言:English
出版: Elsevier 2019

相似书籍