标题:How Hard Is Bribery with Distance Restrictions?
作者:Yang, Yongjie; Shrestha, Yash Raj; Guo, Jiong
作者机构:[Yang, Yongjie; Guo, Jiong] Shandong Univ, Jinan, Peoples R China.; [Yang, Yongjie] Univ Saarland, D-66123 Saarbrucken, Germany.; [Shrestha, Yash 更多
会议名称:22nd European Conference on Artificial Intelligence (ECAI)
会议日期:AUG 29-SEP 02, 2016
来源:ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
出版年:2016
卷:285
页码:363-371
DOI:10.3233/978-1-61499-672-9-363
摘要:We study the complexity of the bribery problem with distance restrictions. In particular, in the bribery problem, we are given an election and a distinguished candidate p, and are asked whether we can make p win/not win the election by bribing at most k voters to recast their votes. In the bribery problem with distance restrictions, we require that the votes recast by the bribed voters are close to their original votes. To measure the closeness between two votes, we adopt the prevalent Kendall-Tau distance and the Hamming distance. We achieve a wide range of complexity results for this problem under a variety of voting correspondences, including the Borda, Condorcet, Copeland(alpha) for every 0 <= alpha <= 1 and Maximin.
收录类别:CPCI-S;EI;SCOPUS
Scopus被引频次:2
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013053937&doi=10.3233%2f978-1-61499-672-9-363&partnerID=40&md5=6f67260d3bc1724ff045c9ad2a07059b
TOP