2019
AAAI
AAAI 2019
Approximation and Hardness of Shift-Bribery
Abstract
Abstract In the SHIFT-BRIBERY problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the votersโ preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.
๐
Conference Pioneer
โ AAAI 2019
๐
Interdisciplinary Bridge
โ Artificial Intelligence and Computer Science and Mathematics & Optimization
๐งญ
Keyword Pioneer
โ election manipulation
๐
Cross-Pollinator
โ Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio