Compact Value-Function Representations for Qualitative Preferences.

Ronen I. Brafman; Carmel Domshlak; Tanya Kogan

Compact Value-Function Representations for Qualitative Preferences.

Ronen I. Brafman, Carmel Domshlak, Tanya Kogan

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

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.

Original language	English
Pages	51-59
Number of pages	9
State	Published - 2004
Event	04, Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence - Banff, Canada Duration: 7 Jul 2004 → 11 Jul 2004

Conference

Conference	04, Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence
Country/Territory	Canada
City	Banff
Period	7/07/04 → 11/07/04

Access to Document

https://dblp.org/db/conf/uai/uai2004.html#BrafmanDK04

Cite this

@conference{577a7a34b3d34378925b42a2c18c1475,

title = "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{\textquoteright} 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 problemof optimal item selection.",

author = "Brafman, {Ronen I.} and Carmel Domshlak and Tanya Kogan",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 04, Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence ; Conference date: 07-07-2004 Through 11-07-2004",

year = "2004",

language = "English",

pages = "51--59",

}

TY - CONF

T1 - Compact Value-Function Representations for Qualitative Preferences.

AU - Brafman, Ronen I.

AU - Domshlak, Carmel

AU - Kogan, Tanya

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2004

Y1 - 2004

N2 - 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 problemof optimal item selection.

AB - 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 problemof optimal item selection.

M3 - Paper

SP - 51

EP - 59

T2 - 04, Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence

Y2 - 7 July 2004 through 11 July 2004

ER -

Compact Value-Function Representations for Qualitative Preferences.

Abstract

Conference

Access to Document

Fingerprint

Cite this