Arrow Research search
Back to AAAI

AAAI 2002

Efficient Utility Functions for Ceteris Paribus Preferences

Conference Paper Markov Decision Processes Artificial Intelligence

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 worstcase cost. This paper describes more efficient constructions that combine analysis of utility independence with constraintbased search.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
AAAI Conference on Artificial Intelligence
Archive span
1980-2026
Indexed papers
28718
Paper id
723680599328981908