Swap Bribery

DOI10.1007/978-3-642-04645-2_27zbMath1262.91056arXiv0905.3885WikidataQ61586277 ScholiaQ61586277MaRDI QIDQ3648865

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko

Publication date: 1 December 2009

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.3885

Mathematics Subject Classification ID

91B12: Voting theory

Related Items

Isomorphic Distances Among Elections, Robustness among multiwinner voting rules, Computational complexity characterization of protecting elections from bribery, How hard is safe bribery?, Priced gerrymandering, Hardness and algorithms for electoral manipulation under media influence, The possible winner with uncertain weights problem, Heuristics for opinion diffusion via local elections, The complexity of priced control in elections, On the hardness of bribery variants in voting with CP-nets, Prices matter for the parameterized complexity of shift bribery, Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules, New candidates welcome! Possible winners with respect to the addition of new candidates, Manipulation can be hard in tractable voting systems even for constant-sized coalitions, The complexity of manipulative attacks in nearly single-peaked electorates, Campaign management under approval-driven voting rules, Path-disruption games: bribery and a probabilistic model, Frugal bribery in voting, NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting, Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules, On the complexity of bribery with distance restrictions, Multivariate complexity analysis of Swap Bribery, Towards a dichotomy for the possible winner problem in elections based on scoring rules, Protecting elections by recounting ballots, Complexity of shift bribery for iterative voting rules, Exploiting social influence to control elections based on positional scoring rules, The complexity of online bribery in sequential elections, The possible winner problem with uncertain weights revisited, Combinatorial \(n\)-fold integer programming and applications, Local distance constrained bribery in voting, Control complexity in Borda elections: solving all open cases of offline control and some cases of online control, Approximation and hardness of shift-Bribery, Distributed monitoring of election winners, Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting, Parameterized resiliency problems, Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey, Bribery in voting with CP-nets, Studies in Computational Aspects of Voting, Multivariate Complexity Analysis of Swap Bribery, Often Harder than in the Constructive Case: Destructive Bribery in CP-nets