Open AccessPosted Content
How Hard Is Bribery in Elections
Reads0
Chats0
TLDR
The complexity of influencing elections through bribery was studied in this paper, where the complexity of determining whether by a certain amount of bribing voters a specified candidate can be made the election's winner was studied.Abstract:
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voters a specified candidate can be made the election's winner? We study this problem for election systems as varied as scoring protocols and Dodgson voting, and in a variety of settings regarding homogeneous-vs.-nonhomogeneous electorate bribability, bounded-size-vs.-arbitrary-sized candidate sets, weighted-vs.-unweighted voters, and succinct-vs.-nonsuccinct input specification. We obtain both polynomial-time bribery algorithms and proofs of the intractability of bribery, and indeed our results show that the complexity of bribery is extremely sensitive to the setting. For example, we find settings in which bribery is NP-complete but manipulation (by voters) is in P, and we find settings in which bribing weighted voters is NP-complete but bribing voters with individual bribe thresholds is in P. For the broad class of elections (including plurality, Borda, k-approval, and veto) known as scoring protocols, we prove a dichotomy result for bribery of weighted voters: We find a simple-to-evaluate condition that classifies every case as either NP-complete or in P.read more
Citations
More filters
BookDOI
Handbook of Computational Social Choice
TL;DR: This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively and offers detailed introductions to each of the field's major themes.
Journal ArticleDOI
Llull and Copeland voting computationally resist bribery and constructive control
TL;DR: Among systems with a polynomial-time winner problem, Copeland voting is the first natural election system proven to have full resistance to constructive control and vulnerability results for microbribery are proven via a novel technique involving min-cost network flow.
Journal ArticleDOI
AI’s War on Manipulation: Are We Winning?
TL;DR: An overview of more than two decades of work that studies computational complexity as a barrier against manipulation in elections is provided.
Journal ArticleDOI
Using complexity to protect elections
TL;DR: Computational complexity may truly be the shield against election manipulation.
Computational Social Choice
Felix Brandt,Ulle Endriss +1 more
TL;DR: The Gibbard-Satterthwaite Impossibility and Computational Hardness of Manipulation as mentioned in this paper are two of the main obstacles in voting rule-based election process, and they have been studied extensively in the literature.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Social Choice and Individual Values
TL;DR: Saari as mentioned in this paper introduced Arrow's Theorem and founded the field of social choice theory in economics and political science, and introduced a new foreword by Nobel laureate Eric Maskin, introducing Arrow's seminal book to a new generation of students and researchers.
Journal ArticleDOI
Social Choice and Individual Values.
Leo A. Goodman,Kenneth J. Arrow +1 more
TL;DR: In this article, the authors present a destination search and find the appropriate manuals for their products, providing you with many Social Choice And Individual Values. You can find the manual you are interested in in printed form or even consider it online.
Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.