Compact Value-Function Representations for Qualitative Preferences
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.
Cite
Text
Brafman et al. "Compact Value-Function Representations for Qualitative Preferences." Conference on Uncertainty in Artificial Intelligence, 2004.Markdown
[Brafman et al. "Compact Value-Function Representations for Qualitative Preferences." Conference on Uncertainty in Artificial Intelligence, 2004.](https://mlanthology.org/uai/2004/brafman2004uai-compact/)BibTeX
@inproceedings{brafman2004uai-compact,
title = {{Compact Value-Function Representations for Qualitative Preferences}},
author = {Brafman, Ronen I. and Domshlak, Carmel and Kogan, Tanya},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2004},
pages = {51-59},
url = {https://mlanthology.org/uai/2004/brafman2004uai-compact/}
}