Aggregating Preferences Represented by Conditional Preference Networks

Abstract

This paper focuses on the task of aggregating preference orders over combinatorial domains, where both the individual and the aggregate preference orders are represented as Conditional Preference Networks (CP-nets). We propose intuitive objective functions for finding an optimal aggregate CP-net, as well as corresponding optimal efficient aggregation algorithms for inputs with certain structural properties.