Conditional importance networks: a graphical language for representing ordinal, monotonic preferences over sets of goods

Authors:
Sylvain Bouveret;Ulle Endriss;Jérôme Lang
Affiliations:
ONERA, DTIM, Toulouse, France;ILLC, University of Amsterdam;LAMSADE, Université Paris-Dauphine
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 6
Cited 8

Extending CP-nets with stronger conditional preference statements

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Preferences over sets

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
On graphical modeling of preference and importance

Journal of Artificial Intelligence Research
Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity

Journal of Artificial Intelligence Research
The computational complexity of dominance and consistency in CP-Nets

Journal of Artificial Intelligence Research

Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Graphical representation of ordinal preferences: languages and applications

ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Preferences in AI: An overview

Artificial Intelligence
Automating analysis of qualitative preferences in goal-oriented requirements engineering

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Representing and reasoning with qualitative preferences for compositional systems

Journal of Artificial Intelligence Research
A service composition framework based on goal-oriented requirements engineering, model checking, and qualitative preference analysis

ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Identifying a preferred countermeasure strategy for attack graphs

Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop
Reasoning with qualitative preferences to develop optimal component-based systems

Proceedings of the 2013 International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.