Graphically structured value-function compilation

Ronen I. Brafman, Carmel Domshlak

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly simple and compact form, making their elicitation much easier. In this paper we consider preferences over discrete domains, and show that for a certain class of simple and intuitive qualitative preference statements, one can always generate compact value functions consistent with these statements. These value functions maintain the independence structure implicit in the original statements. For discrete domains, these representation theorems are much more general than previous results. However, we also show that it is not always possible to maintain this compact structure if we add explicit ordering constraints among the available outcomes.

Original languageEnglish
Pages (from-to)325-349
Number of pages25
JournalArtificial Intelligence
Issue number2-3
StatePublished - 1 Feb 2008


  • Multi-attribute decision making
  • Qualitative decision theory
  • Reasoning about preferences

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence


Dive into the research topics of 'Graphically structured value-function compilation'. Together they form a unique fingerprint.

Cite this