• 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 - Request a copy

Hypercubewise Preference Aggregation in Multi-Issue Domains

Conitzer, Vincent; Lang, Jérôme; Xia, Lirong (2011), Hypercubewise Preference Aggregation in Multi-Issue Domains, in Walsh, Toby, Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI11), AAAI Press/International Joint Conferences on Artificial Intelligence, p. 158-163

Type
Communication / Conférence
Date
2011
Conference country
SPAIN
Book title
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI11)
Book author
Walsh, Toby
Publisher
AAAI Press/International Joint Conferences on Artificial Intelligence
Published in
Menlo Park
ISBN
978-1-57735-512-0
Pages
158-163
Metadata
Show full item record
Author(s)
Conitzer, Vincent
Lang, Jérôme
Xia, Lirong
Abstract (EN)
We consider a framework for preference aggregation on multiple binary issues, where agents’ preferences are represented by (possibly cyclic) CP-nets. We focus on the majority aggregation of the individual CP-nets, which is the CP-net where the direction of each edge of the hypercube is decided according to the majority rule. First we focus on hypercube Condorcet winners (HCWs); in particular, we show that, assuming a uniform distribution for the CP-nets, the probability that there exists at least one HCW is at least 1 − 1 /e, and the expected number of HCWs is 1 . Our experimental results confirm these results. We also show experimental results under the Imp a rtia l Cu ltu re assumption. We then generalize a few tournament solutions to select winners from (weighted) majoritarian CP-nets, namely Copeland, maximin, and Kemeny. For each of these, we address some social choice theoretic and computational issues.
Subjects / Keywords
CP-nets; Hypercubewise Preference Aggregation; preference aggregation

Related items

Showing items related by title and author.

  • Thumbnail
    Strategic Sequential Voting in Multi-Issue Domains and Multiple-Election Paradoxes 
    Xia, Lirong; Conitzer, Vincent; Lang, Jérôme (2011) Communication / Conférence
  • Thumbnail
    Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains 
    Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2012) Communication / Conférence
  • Thumbnail
    Voting on multi-issue domains with conditionally lexicographic preferences 
    Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2018) Article accepté pour publication ou publié
  • Thumbnail
    Sequential composition of voting rules in multi-issue domains 
    Lang, Jérôme; Xia, Lirong (2009) Article accepté pour publication ou publié
  • Thumbnail
    How hard is it to Control Sequential Elections via the Agenda? 
    Conitzer, Vincent; Lang, Jérôme; Xia, Lirong (2009) 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