Thumbnail

Winner Determination in Sequential Majority Voting

Lang, Jérôme; Pini, Maria Silvia; Rossi, Francesca; Venable, Kristen Brent; Walsh, Toby (2007), Winner Determination in Sequential Majority Voting, in Veloso, Manuela, IJCAI 2007, International Joint Conferences on Artifical Intelligence - Proceedings, AAAI Press / IJCAI : Palo Alto (USA), p. 1372-1377

View/Open
Type
Communication / Conférence
Date
2007
Conference country
INDIA
Book title
IJCAI 2007, International Joint Conferences on Artifical Intelligence - Proceedings
Book author
Veloso, Manuela
Publisher
AAAI Press / IJCAI
Published in
Palo Alto (USA)
Pages
1372-1377
Metadata
Show full item record
Author(s)
Lang, Jérôme

Pini, Maria Silvia

Rossi, Francesca cc

Venable, Kristen Brent

Walsh, Toby
Abstract (EN)
Preferences can be aggregated using voting rules.We consider here the family of rules which performa sequence of pairwise majority comparisons between two candidates. The winner thus depends onthe chosen sequence of comparisons, which can berepresented by a binary tree. We address the difficulty of computing candidates that win for sometrees, and then introduce and study the notion offair winner, i.e. candidates who win in a balancedtree. We then consider the situation where we lackcomplete informations about preferences, and determine the computational complexity of computing winners in this case.
Subjects / Keywords
Preference representation; vote