View in EDS

The complexity of online manipulation of sequential elections.

Saved in:
Bibliographic Details
Title: The complexity of online manipulation of sequential elections.
Authors: Hemaspaandra, Edith1, Hemaspaandra, Lane A.2, Rothe, Jörg3
Source: Journal of Computer & System Sciences. Jun2014, Vol. 80 Issue 4, p697-710. 14p.
Subjects: Computational complexity, Table manipulation (Computer science), Polynomials, Online education, Uniqueness (Mathematics), Completeness theorem, Social choice
Abstract: Abstract: Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential. We introduce a framework, in which manipulators can see the past votes but not the future ones, to model online coalitional manipulation of sequential elections, and we show that here manipulation can be extremely complex even for election systems with simple winner problems. We also show that for some of the most important election systems such manipulation is simple in certain settings. Among our highlights are: Depending on the size of the manipulative coalition, the online manipulation problem can be complete for each level of the polynomial hierarchy or even for PSPACE. We obtain the most dramatic contrast to date between the nonunique-winner and unique-winner models: Online weighted manipulation for plurality is in P in the nonunique-winner model, yet is coNP-hard (constructive case) and NP-hard (destructive case) in the unique-winner model. And we obtain what to the best of our knowledge are the first -completeness and -completeness results in computational social choice, in particular regarding 3-candidate and 4-candidate (and unlimited-candidate) online weighted coalition manipulation of veto elections. [Copyright &y& Elsevier]
Copyright of Journal of Computer & System Sciences is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Abstract: Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential. We introduce a framework, in which manipulators can see the past votes but not the future ones, to model online coalitional manipulation of sequential elections, and we show that here manipulation can be extremely complex even for election systems with simple winner problems. We also show that for some of the most important election systems such manipulation is simple in certain settings. Among our highlights are: Depending on the size of the manipulative coalition, the online manipulation problem can be complete for each level of the polynomial hierarchy or even for PSPACE. We obtain the most dramatic contrast to date between the nonunique-winner and unique-winner models: Online weighted manipulation for plurality is in P in the nonunique-winner model, yet is coNP-hard (constructive case) and NP-hard (destructive case) in the unique-winner model. And we obtain what to the best of our knowledge are the first -completeness and -completeness results in computational social choice, in particular regarding 3-candidate and 4-candidate (and unlimited-candidate) online weighted coalition manipulation of veto elections. [Copyright &y& Elsevier]
ISSN:00220000
DOI:10.1016/j.jcss.2013.10.001