Frugal bribery in voting

Dey, Palash and Misra, Neeldhara and Narahari, Y (2017) Frugal bribery in voting. In: THEORETICAL COMPUTER SCIENCE, 676 . pp. 15-32.

PDF The_Com_Sci_676_15_2017.pdf - Published Version Restricted to Registered users only Download (569kB) | Request a copy

Abstract

Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $BRIBERY problem, namely, FRUGAL-BRIBERY and FRUGAL-$BRIBERY where the briber is frugal in nature. By this, we mean that the briber is only able to influence voters who benefit from the suggestion of the briber. More formally, a voter is vulnerable if the outcome of the election improves according to her own preference when she accepts the suggestion of the briber. In the FRUGAL-BRIBERY problem, the goal is to make a certain candidate win the election by changing only the vulnerable votes. In the FRUGAL-$BRIBERY problem, the vulnerable votes have prices and the goal is to make a certain candidate win the election by changing only the vulnerable votes, subject to a budget constraint. We further formulate two natural variants of the FRUGAL-$BRIBERY problem namely UNIFORM-FRUGAL-$BRIBERY and NONUNIFORM-FRUGAL-$BRIBERY where the prices of the vulnerable votes are, respectively, all the same or different. The FRUGAL-BRIBERY problem turns out to be a special case of sophisticated $BRIBERY as well as SWAP-BRIBERY problems. Whereas the FRUGAL-$BRIBERY problem turns out to be a special case of the $BRIBERY problem. We show that the FRUGAL-BRIBERY problem is polynomial time solvable for the k-approval, k -veto, and plurality with run off voting rules for unweighted elections. These results establish success in finding practically appealing as well as polynomial time solvable special cases of the sophisticated $BRIBERY and SWAP-BRIBERY problems. On the other hand, we show that the FRUGAL-BRIBERY problem is NP-complete for the Borda voting rule and the FRUGAL-$BRIBERY problem is NP-complete for most of the voting rules studied here barring the plurality and the veto voting rules for unweighted elections. Our hardness results of the FRUGAL-BRIBERY and the FRUGAL-$BRIBERY problems thus subsumes and strengthens the hardness results of the $BRIBERY problem from the literature. For the weighted elections, we show that the FRUGAL-BRIBERY problem is NP-complete for all the voting rules studied here except the plurality voting rule even when the number of candidates is as low as 3 (for the STV and the plurality with run off voting rules) or 4 (for the maximin, the Copeland(alpha) with alpha is an element of 0, 1), and the simplified Bucklin voting rules). In our view, the fact that the simplest FRUGAL-BRIBERY problem becomes computationally intractable for many important voting rules (except the plurality voting rule) even with very few candidates is surprising as well as interesting. (C) 2017 Elsevier B.V. All rights reserved.

Item Type:	Journal Article
Publication:	THEORETICAL COMPUTER SCIENCE
Additional Information:	Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	10 Jun 2017 04:38
Last Modified:	31 Jan 2019 10:12
URI:	http://eprints.iisc.ac.in/id/eprint/57160

Actions (login required)

View Item