Hypercubewise Preference Aggregation in Multi-Issue Domains
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 158-162.
Abstract
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 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.
@inproceedings{ijcai2011p38,
title = {Hypercubewise Preference Aggregation in Multi-Issue Domains},
author = {Conitzer, Vincent and Lang, Jérôme and Xia, Lirong},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {158--162},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-038},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-038},
}
TY - CPAPER TI - Hypercubewise Preference Aggregation in Multi-Issue Domains AU - Conitzer, Vincent AU - Lang, Jérôme AU - Xia, Lirong T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 158 EP - 162 DO - 10.5591/978-1-57735-516-8/IJCAI11-038 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-038 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: