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