Multivariate Complexity Analysis of Swap Bribery

We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swapping the positions of two consecutive candidates in his preference ranking. The question is whether it is possible, without exceeding a given budget, to bribe the voters in a way that the preferred candidate wins in the election.We initiate a parameterized and multivariate complexity analysis of Swap Bribery, focusing on the case of k-approval. We investigate how different cost functions affect the computational complexity of the problem. We identify a special case of k-approval for which the problem can be solved in polynomial time, whereas we prove NP-hardness for a slightly more general scenario. We obtain fixed-parameter tractability as well as W[1]-hardness results for certain natural parameters.

[1]  Piotr Faliszewski,et al.  Llull and Copeland Voting Computationally Resist Bribery and Constructive Control , 2009, J. Artif. Intell. Res..

[2]  Jérôme Lang,et al.  Voting procedures with incomplete preferences , 2005 .

[3]  Vincent Conitzer,et al.  When are elections with few candidates hard to manipulate? , 2007, J. ACM.

[4]  Piotr Faliszewski,et al.  Approximation Algorithms for Campaign Management , 2010, WINE.

[5]  P. Fishburn,et al.  Voting Procedures , 2022 .

[6]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[7]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[8]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[9]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[10]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[11]  Peter C. Fishburn,et al.  Chapter 4 Voting procedures , 2002 .

[12]  Rolf Niedermeier,et al.  A logic for causal reasoning , 2003, IJCAI 2003.

[13]  Hans L. Bodlaender,et al.  Kernelization: New Upper and Lower Bound Techniques , 2009, IWPEC.

[14]  Nadja Betzler,et al.  Parameterized complexity of candidate control in elections and related digraph problems , 2008, Theor. Comput. Sci..

[15]  Nadja Betzler,et al.  Towards a dichotomy for the Possible Winner problem in elections based on scoring rules , 2009, J. Comput. Syst. Sci..

[16]  Piotr Faliszewski,et al.  Nonuniform Bribery , 2007, AAMAS.

[17]  Michael R. Fellows,et al.  On complexity of lobbying in multiple referenda , 2006 .

[18]  Piotr Faliszewski,et al.  Multimode Control Attacks on Elections , 2009, IJCAI.

[19]  Rolf Niedermeier,et al.  Reflections on Multivariate Algorithmics and Problem Parameterization , 2010, STACS.

[20]  Piotr Faliszewski,et al.  The Complexity of Bribery in Elections , 2006, AAAI.

[21]  Vincent Conitzer,et al.  Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders , 2008, AAAI.

[22]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[23]  Edith Hemaspaandra,et al.  Dichotomy for voting systems , 2005, J. Comput. Syst. Sci..

[24]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[25]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[26]  Nadja Betzler.  On Problem Kernels for Possible Winner Determination under the k-Approval Protocol , 2010, MFCS.

[27]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[28]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[29]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[30]  Hong Liu,et al.  Parameterized computational complexity of control problems in voting systems , 2009, Theor. Comput. Sci..

[31]  Piotr Faliszewski,et al.  Swap Bribery , 2009, SAGT.