The complexity of priced control in elections
From MaRDI portal
Publication:314424
DOI10.1007/s10472-015-9478-2zbMath1372.91033OpenAlexW1752877853WikidataQ59471985 ScholiaQ59471985MaRDI QIDQ314424
Tomasz Miasko, Piotr Faliszewski
Publication date: 16 September 2016
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-015-9478-2
Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (4)
Optimal defense against election control by deleting voter groups ⋮ Priced gerrymandering ⋮ A parameterized perspective on protecting elections ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prices matter for the parameterized complexity of shift bribery
- New candidates welcome! Possible winners with respect to the addition of new candidates
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Parameterized complexity of control problems in Maximin election
- The complexity of Kemeny elections
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Anyone but him: the complexity of precluding an alternative
- Parameterized computational complexity of control problems in voting systems
- Voting schemes for which it can be difficult to tell who won the election
- How hard is it to control an election?
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Exact complexity of the winner problem for Young elections
- Multivariate complexity analysis of Swap Bribery
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Combinatorial voter control in elections
- Large-Scale Election Campaigns: Combinatorial Shift Bribery
- Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
- Search versus Decision for Election Manipulation Problems
- Multimode Control Attacks on Elections
- Bribery in Path-Disruption Games
- Swap Bribery
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- How Hard Is Bribery in Elections?
- Manipulation of Voting Schemes: A General Result
- Exact analysis of Dodgson elections
- Elections with Few Voters: Candidate Control Can Be Easy
- Weighted Electoral Control
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
This page was built for publication: The complexity of priced control in elections
