The Complexity of Succinct Elections
DOI:
https://doi.org/10.1609/aaai.v31i1.11122Keywords:
elections, complexity, manipulative actions, succinct representationAbstract
The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the preferences of the electorate succinctly, as the distinct votes and their counts. Though the succinct representation may be exponentially smaller than the nonsuccinct, we find only one natural case where the complexity increases, in sharp contrast to the case where each voter has a weight, where the complexity usually increases.
Downloads
Published
2017-02-12
How to Cite
Fitzsimmons, Z., & Hemaspaandra, E. (2017). The Complexity of Succinct Elections. Proceedings of the AAAI Conference on Artificial Intelligence, 31(1). https://doi.org/10.1609/aaai.v31i1.11122
Issue
Section
Student Abstract Track