Abstract
We study the complexity of the constructive/destructive bribery problem with distance restrictions. In the constructive/destructive bribery problem, we are given an election and a distinguished candidate p, and are asked whether we can make p a winner/loser by bribing a limited number of voters to recast their votes. In the constructive/destructive bribery problem with distance restrictions, we require that the votes recast by the bribed voters are close to their original votes. In particular, we measure the closeness of two votes by the minimum number of swaps of candidates needed to transform one vote into the other. We consider both the case where swaps only take place between consecutive candidates, and the case where swaps can take place between any arbitrary candidates. We achieve a wide range of complexity results for the voting correspondences Borda, Condorcet, Copelandα for every rational number 0≤α≤1, and Maximin.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
