Voting and Bribing in Single-Exponential Time

Author:

Knop Dušan1,Koutecký Martin2,Mnich Matthias3

Affiliation:

1. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic

2. Charles University, Czech Republic

3. TU Hamburg, Germany

Abstract

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].

Funder

Deutsche Forschungsgemeinschaft

OP VVV MEYS

European Research Council

Charles University project

GA ČR

“Research Center for Informatics”

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)

Cited by 12 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3