Efficient utility functions for ceteris paribus preferences

  • Authors:
  • Michael McGeachie;Jon Doyle

  • Affiliations:
  • Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Computer Science, North Carolina State University, Raleigh, NC

  • Venue:
  • Eighteenth national conference on Artificial intelligence
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ceteris paribus (other things being equal) preference provides a convenient means for stating constraints on numeric utility functions, but direct constructions of numerical utility representations from such statements have exponential worst-case cost. This paper describes more efficient constructions that combine analysis of utility independence with constraint-based search.