ML Anthology

Efficient Utility Functions for Ceteris Paribus Preferences

Michael McGeachie, Jon Doyle
AAAI 2002 pp. 279-284
doi:10.5555/777092.777138 /aaai/2002/mcgeachie2002aaai-efficient/

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.

PDF AAAI Semantic Scholar

Cite

Text

McGeachie and Doyle. "Efficient Utility Functions for Ceteris Paribus Preferences." AAAI Conference on Artificial Intelligence, 2002. doi:10.5555/777092.777138

Markdown

[McGeachie and Doyle. "Efficient Utility Functions for Ceteris Paribus Preferences." AAAI Conference on Artificial Intelligence, 2002.](https://mlanthology.org/aaai/2002/mcgeachie2002aaai-efficient/) doi:10.5555/777092.777138

BibTeX

@inproceedings{mcgeachie2002aaai-efficient,
  title     = {{Efficient Utility Functions for Ceteris Paribus Preferences}},
  author    = {McGeachie, Michael and Doyle, Jon},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2002},
  pages     = {279-284},
  doi       = {10.5555/777092.777138},
  url       = {https://mlanthology.org/aaai/2002/mcgeachie2002aaai-efficient/}
}