Papers
Topics
Authors
Recent
Search
2000 character limit reached

Enriching a CP-Net by Asymmetric Merging

Published 21 Sep 2021 in cs.MA | (2109.10110v1)

Abstract: Conditional ceteris paribus preference networks (CP-nets) are commonly used to capture qualitative conditional preferences. In many use cases, when the preferential structure of an agent is incomplete, information from other preferential structures (e.g. that of other users) preferences can be used to fill in the gaps. Earlier works proposed methods to symmetrically merge multiple incomplete CP-nets by means of voting semantics. However, the merged CP-net can contain preference relations that do not fit to a given user's original preference profile. This paper proposes an asymmetric merging (or enriching) method to obtain and fill-in preference relations of a user's CP-net from another CP-net in a way that preserves the original preference relations.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.