How hard is it to Control Sequential Elections via the Agenda?
Conitzer, Vincent; Lang, Jérôme; Xia, Lirong (2009), How hard is it to Control Sequential Elections via the Agenda?, IJCAI-09, 21st International Joint Conference on Artificial Intelligence, AAAI Press / IJCAI : Palo Alto (USA), p. 103-108
TypeCommunication / Conférence
Conference countryUNITED STATES
Book titleIJCAI-09, 21st International Joint Conference on Artificial Intelligence
MetadataShow full item record
Abstract (EN)Voting on multiple related issues is an importantand difﬁcult problem. The key difﬁculty is that thenumber of alternatives is exponential in the numberof issues, and hence it is infeasible for the agentsto rank all the alternatives. A simple approach is tovote on the issues one at a time, in sequence; however, a drawback is that the outcome may dependon the order in which the issues are voted upon anddecided, which gives the chairperson some controlover the outcome of the election because she canstrategically determine the order. While this is undeniably a negative feature of sequential voting, inthis paper we temper this judgment by showing thatthe chairperson’s control problem is, in most cases,computationally hard.
Subjects / KeywordsVoting
Showing items related by title and author.