Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Multiagent Systems

arXiv:2109.10110 (cs)
[Submitted on 21 Sep 2021]

Title:Enriching a CP-Net by Asymmetric Merging

Authors:Stijn Henckens, Mostafa Mohajeri Parizi, Giovanni Sileno
View PDF
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.
Subjects: Multiagent Systems (cs.MA)
Cite as: arXiv:2109.10110 [cs.MA]
  (or arXiv:2109.10110v1 [cs.MA] for this version)
  https://doi.org/10.48550/arXiv.2109.10110

Submission history

From: Stijn Henckens [view email]
[v1] Tue, 21 Sep 2021 11:44:11 UTC (39 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.MA
< prev   |   next >
new | recent | 2021-09
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Giovanni Sileno
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)