Voting and bribing in single-exponential time

DOI10.4230/LIPICS.STACS.2017.46MaRDI QIDQ4636646zbMATH OpenFDO

Authors Dušan Knop, Martin Koutecký, Matthias Mnich

Publication date 19 April 2018

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

zbMATH Keywords

parameterized algorithm\(n\)-fold integer programmingswap bribery

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Voting theory (91B12)

Recommendations

• Frugal bribery in voting
• How hard is bribery in elections?
• Approximating weighted and priced bribery in scoring rules
• Complexity of shift bribery in committee elections
• Approximation and hardness of shift-bribery

Cited in

(28)

• Combinatorial \(n\)-fold integer programming and applications
• Approximating weighted and priced bribery in scoring rules
• Parameterized resiliency problems
• Robustness among multiwinner voting rules
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• About the complexity of two-stage stochastic IPs
• Complexity of shift bribery in committee elections
• The complexity of online bribery in sequential elections
• Scheduling meets n-fold integer programming
• Multivariate complexity analysis of swap bribery
• Integer programming in parameterized complexity: three miniatures
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• Complexity of shift bribery for iterative voting rules
• Local distance constrained bribery in voting
• Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
• Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming
• Integer programming in parameterized complexity: five miniatures
• Evaluating and tuning n-fold integer programming
• Swap bribery
• scientific article; zbMATH DE number 7651172 (Why is no real title available?)
• Tight complexity lower bounds for integer linear programming with few constraints
• About the Complexity of Two-Stage Stochastic IPs
• scientific article; zbMATH DE number 7450032 (Why is no real title available?)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
• Faster Algorithms for Integer Programs with Block Structure
• Combinatorial \(n\)-fold integer programming and applications
• Elections with few candidates: prices, weights, and covering problems
• Frugal bribery in voting

This page was built for publication: Voting and bribing in single-exponential time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636646)