Compact Value-Function Representations for Qualitative Preferences
Ronen I. Brafman, Carmel Domshlak, Tanya Kogan
TL;DR
This paper introduces strong theoretical foundations for factored value functions and presents a methodology for optimal item selection in preference elicitation systems, improving efficiency and effectiveness.
Contribution
It provides new representation theorems for factored value functions and a methodology for optimal item selection based on these representations.
Findings
Strong representation theorems for factored value functions
A new methodology for optimal item selection
Enhanced efficiency in preference elicitation systems
Abstract
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation focused on structured models that provide a factored representation of users' preferences. Such models require less information to construct and support efficient reasoning algorithms. This paper makes two substantial contributions to this area: (1) Strong representation theorems for factored value functions. (2) A methodology that utilizes our representation results to address the problem of optimal item selection.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Rough Sets and Fuzzy Logic · Bayesian Modeling and Causal Inference