ML Anthology

Preferences over Sets

Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony, Y. Silver
AAAI 2006 pp. 1101-1106
/aaai/2006/brafman2006aaai-preferences/

Abstract

Typically, work on preference elicitation and reasoning about preferences has focused on the problem of specifying, modeling, and optimizing with preference over outcomes corresponding to single objects of interest. In a number of applications, however, the “outcomes ” of interest are really sets of such atomic outcomes. For instance, when trying to form coalitions or committees, we need to select an optimal combination of individuals. In this paper we describe some initial work on specifying preferences over sets of objects, and selecting an optimal subset from a given set of objects. In particular, we show how TCP-nets can be used to handle this problem, and how an existing algorithm for preference-based constrained optimization can be adapted to the problem of optimal subset selection. 1

PDF AAAI Semantic Scholar

Cite

Text

Brafman et al. "Preferences over Sets." AAAI Conference on Artificial Intelligence, 2006.

Markdown

[Brafman et al. "Preferences over Sets." AAAI Conference on Artificial Intelligence, 2006.](https://mlanthology.org/aaai/2006/brafman2006aaai-preferences/)

BibTeX

@inproceedings{brafman2006aaai-preferences,
  title     = {{Preferences over Sets}},
  author    = {Brafman, Ronen I. and Domshlak, Carmel and Shimony, Solomon Eyal and Silver, Y.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2006},
  pages     = {1101-1106},
  url       = {https://mlanthology.org/aaai/2006/brafman2006aaai-preferences/}
}