Complexity of shift bribery in committee elections

Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study the (parameterized) complexity of SHIFT BRIBERY for multiwinner voting rules. We focus on the SNTV, Bloc, k-Borda, and Chamberlin-Courant rules, as well as on approximate variants of the Chamberlin-Courant rule, since the original rule is NP-hard to compute. We show that SHIFT BRIBERY tends to be significantly harder in the multiwinner setting than in the single-winner one by showing settings where SHIFT BRIBERY is easy in the single-winner cases, but is hard (and hard to approximate) in the multiwinner ones. We show that the non-monotonicity of those rules which are based on approximation algorithms for the Chamberlin-Courant rule sometimes affects the complexity of SHIFT BRIBERY.

Original languageAmerican English
Title of host publication30th AAAI Conference on Artificial Intelligence, AAAI 2016
Pages2452-2458
Number of pages7
ISBN (Electronic)9781577357605
StatePublished - 1 Jan 2016
Externally publishedYes
Event30th AAAI Conference on Artificial Intelligence, AAAI 2016 - Phoenix, United States
Duration: 12 Feb 201617 Feb 2016

Publication series

Name30th AAAI Conference on Artificial Intelligence, AAAI 2016

Conference

Conference30th AAAI Conference on Artificial Intelligence, AAAI 2016
Country/TerritoryUnited States
CityPhoenix
Period12/02/1617/02/16

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Complexity of shift bribery in committee elections'. Together they form a unique fingerprint.

Cite this