Similarity Measures on Preference Structures, Part II: Utility Functions

Abstract

In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user preferences. We introduced the probabilistic distance as a measure of similarity on user preferences, and provided an algorithm to compute the distance between two partially specified value functions. This is for the case of decision making under certainty. In this paper we address the more challenging issue of computing the probabilistie distance in the ease of decision making under uncertainty. We present algorithms to compute the probabilistic distance between two completely or partially specified utility functions. We demonstrate the use of this algorithm with a medical data set of partially specified patient preferences, where none of the other existing distance measures appear definable. Using this data set, we also demonstrate that the case-based approach to preference elicitation is applicable in domains with uncertainty.

Cite

Text

Ha et al. "Similarity Measures on Preference Structures, Part II: Utility Functions." Conference on Uncertainty in Artificial Intelligence, 2001.

Markdown

[Ha et al. "Similarity Measures on Preference Structures, Part II: Utility Functions." Conference on Uncertainty in Artificial Intelligence, 2001.](https://mlanthology.org/uai/2001/ha2001uai-similarity/)

BibTeX

@inproceedings{ha2001uai-similarity,
  title     = {{Similarity Measures on Preference Structures, Part II: Utility Functions}},
  author    = {Ha, Vu A. and Haddawy, Peter and Miyamoto, John},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2001},
  pages     = {186-193},
  url       = {https://mlanthology.org/uai/2001/ha2001uai-similarity/}
}