• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods

Bouveret, Sylvain; Endriss, Ulle; Lang, Jérôme (2009), Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods, IJCAI-09, 21st International Joint Conference on Artificial Intelligence, AAAI Press / IJCAI : Palo Alto (USA), p. 67-72

View/Open
publi1177.pdf (169.0Kb)
Type
Communication / Conférence
Date
2009
Conference country
UNITED STATES
Book title
IJCAI-09, 21st International Joint Conference on Artificial Intelligence
Publisher
AAAI Press / IJCAI
Published in
Palo Alto (USA)
Pages
67-72
Metadata
Show full item record
Author(s)
Bouveret, Sylvain cc
Endriss, Ulle
Lang, Jérôme
Abstract (EN)
While there are several languages for representingcombinatorial preferences over sets of alternatives,none of these are well-suited to the representationof ordinal preferences over sets of goods (which aretypically required to be monotonic). We proposesuch a language, taking inspiration from previouswork on graphical languages for preference representation, specifically CP-nets, and introduce conditional importance networks (CI-nets). A CI-netincludes statements of the form “if I have a set Aof goods, and I do not have any of the goods fromsome other set B, then I prefer the set of goods Cover the set of goods D.” We investigate expressivity and complexity issues for CI-nets. Then weshow that CI-nets are well-suited to the descriptionof fair division problems.
Subjects / Keywords
Combinatorial Preferences

Related items

Showing items related by title and author.

  • Thumbnail
    Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods 
    Bouveret, Sylvain; Endriss, Ulle; Lang, Jérôme (2010) Communication / Conférence
  • Thumbnail
    Graphical Representation of Ordinal Preferences: Languages and Applications 
    Lang, Jérôme (2010) Communication / Conférence
  • Thumbnail
    Succinctness of Languages for Judgment Aggregation 
    Endriss, Ulle; Grandi, Umberto; de Haan, Ronald; Lang, Jérôme (2016) Communication / Conférence
  • Thumbnail
    Scoring Rules for the Allocation of Indivisible Goods 
    Baumeister, Dorothea; Bouveret, Sylvain; Lang, Jérôme; Nguyen, Nhan-Tam; Nguyen, Trung Thanh; Rothe, Jörg (2014) Communication / Conférence
  • Thumbnail
    Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modelling 
    Chevaleyre, Yann; Endriss, Ulle; Lang, Jérôme (2006) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo