A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Aggregating CP-nets with Unfeasible Outcomes
[chapter]
2014
Lecture Notes in Computer Science
We consider settings where a collection of agents express preferences over a set of candidates with a combinatorial structure via the use of CP-nets, and we need to exploit the information contained in the CP-nets to choose one of the candidates. Moreover, there is a set of constraints which defines the unfeasible candidates, which cannot be the result of the preference aggregation. We propose a method to achieve this which is based on voting, and considers one variable at a time in a sequence.
doi:10.1007/978-3-319-10428-7_28
fatcat:z3sk32ihojb6jgigntzl74skeu