Winner Determination in Sequential Majority Voting
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 1372-1376.
Abstract
Preferences can be aggregated using voting rules. We consider here the family of rules which perform a sequence of pairwise majority comparisons between two candidates. The winner thus depends on the chosen sequence of comparisons, which can be represented by a binary tree. We address the difficulty of computing candidates that win for some trees, and then introduce and study the notion of fair winner, i.e. candidates who win in a balanced tree. We then consider the situation where we lack complete informations about preferences, and determine the computational complexity of computing winners in this case.
@inproceedings{ijcai2007p221,
title = {Winner Determination in Sequential Majority Voting},
author = {Lang, Jérôme and Pini, Maria Silvia and Rossi, Francesca and Venable, Kristen Brent and Walsh, Toby},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {1372--1376},
year = {2007},
url = {https://ijcai.org/proceedings/2007/221},
}
TY - CPAPER TI - Winner Determination in Sequential Majority Voting AU - Lang, Jérôme AU - Pini, Maria Silvia AU - Rossi, Francesca AU - Venable, Kristen Brent AU - Walsh, Toby T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 1372 EP - 1376 UR - https://ijcai.org/proceedings/2007/221 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
