Graphically structured value-function compilation

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. 

• Type: Journal
• Year: 2008
• Where: AI
• Authors: Ronen I. Brafman, Carmel Domshlak
• Keywords: AI 2008, Artificial Intelligence, Compact Value Functions, Intuitive Qualitative Preference, Value Functions