Hypercubewise preference aggregation in multi-issue domains


Conference Paper

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 HCWis 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 Impartial Culture 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.

Full Text

Duke Authors

Cited Authors

  • Conitzer, V; Lang, J; Xia, L

Published Date

  • December 1, 2011

Published In

Start / End Page

  • 158 - 163

International Standard Serial Number (ISSN)

  • 1045-0823

International Standard Book Number 13 (ISBN-13)

  • 9781577355120

Digital Object Identifier (DOI)

  • 10.5591/978-1-57735-516-8/IJCAI11-038

Citation Source

  • Scopus