Probabilistic Conditional Preference Networks
Abstract
This paper proposes a "probabilistic" extension of conditional preference networks as a way to compactly represent a probability distributions over preference orderings. It studies the probabilistic counterparts of the main reasoning tasks, namely dominance testing and optimisation from the algorithmical and complexity viewpoints. Efficient algorithms for tree-structured probabilistic CP-nets are given. As a by-product we obtain a linear-time algorithm for dominance testing in standard, tree-structured CP-nets.
Cite
Text
Bigot et al. "Probabilistic Conditional Preference Networks." Conference on Uncertainty in Artificial Intelligence, 2013.Markdown
[Bigot et al. "Probabilistic Conditional Preference Networks." Conference on Uncertainty in Artificial Intelligence, 2013.](https://mlanthology.org/uai/2013/bigot2013uai-probabilistic/)BibTeX
@inproceedings{bigot2013uai-probabilistic,
title = {{Probabilistic Conditional Preference Networks}},
author = {Bigot, Damien and Zanuttini, Bruno and Fargier, Hélène and Mengin, Jérôme},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2013},
url = {https://mlanthology.org/uai/2013/bigot2013uai-probabilistic/}
}