PP-2009-36: Bouveret, Sylvain and Endriss, Ulle and Lang, Jérôme (2009) Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods. [Report]
Preview |
Text (Full Text)
PP-2009-36.text.pdf Download (173kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2009-36.abstract.txt Download (1kB) |
Abstract
While there are several languages for representing combinatorial
preferences over sets of alternatives, none of these are well-suited
to the representation of ordinal preferences over sets of goods (which
are typically required to be monotonic). We propose such a language,
taking inspiration from previous work on graphical languages for
preference representation, specifically CP-nets, and introduce
conditional importance networks (CI-nets). A CI-net includes
statements of the form "if I have a set A of goods, and I do not have
any of the goods from some other set B, then I prefer the set of goods
C over the set of goods D." We investigate expressivity and complexity
issues for CI-nets. Then we show that CI-nets are well-suited to the
description of fair division problems.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2009-36 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2009 |
| Uncontrolled Keywords: | preferences; knowledge representation |
| Depositing User: | Ulle Endriss |
| Date Deposited: | 12 Oct 2016 14:37 |
| Last Modified: | 12 Oct 2016 14:37 |
| URI: | https://eprints.illc.uva.nl/id/eprint/366 |
Actions (login required)
 |
View Item |
