We introduce a general problem about bribery in voting systems. In the R -M ulti -B ribery problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate is a winner in the perturbed election under the voting rule R . Voters assign prices for withdrawing their vote, for swapping the positions of two consecutive candidates in their preference order, and for perturbing their approval count to favour candidates. As our main result, we show that R -M ulti -B ribery is fixed-parameter tractable parameterized by the number of candidates | C | with only a single-exponential dependence on | C |, for many natural voting rules R , including all natural scoring protocols, maximin rule, Bucklin rule, Fallback rule, SP-AV, and any C1 rule. The vast majority of previous work done in the setting of few candidates proceeds by grouping voters into at most | C |! types by their preference, constructing an integer linear program with | C |! 2 variables, and solving it by Lenstra’s algorithm in time | C |! | C |! 2 , hence double-exponential in | C |. Note that it is not possible to encode a large number of different voter costs in this way and still obtain a fixed-parameter algorithm, as that would increase the number of voter types and hence the dimension. These two obstacles of double-exponential complexity and restricted costs have been formulated as “Challenges #1 and #2” of the “Nine Research Challenges in Computational Social Choice” by Bredereck et al. Hence, our result resolves the parameterized complexity of R -S wap -B ribery for the aforementioned voting rules plus Kemeny’s rule, and for all rules except Kemeny brings the dependence on | C | down to single-exponential. The engine behind our progress is the use of a new integer linear programming formulation, using so-called “ n -fold integer programming.” Since its format is quite rigid, we introduce “extended n -fold IP,” which allows many useful modeling tricks. Then, we model R -M ulti -B ribery as an extended n -fold IP and apply an algorithm of Hemmecke et al. [Math. Prog. 2013].