移位贿赂的逼近性与硬度

Artif. Intell. Pub Date : 2019-07-17 DOI:10.1609/AAAI.V33I01.33011901

P. Faliszewski, Pasin Manurangsi, Krzysztof Sornat

{"title":"移位贿赂的逼近性与硬度","authors":"P. Faliszewski, Pasin Manurangsi, Krzysztof Sornat","doi":"10.1609/AAAI.V33I01.33011901","DOIUrl":null,"url":null,"abstract":"In the SHIFT-BRIBERY problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the voters’ preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"1 1","pages":"103520"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Approximation and Hardness of Shift-Bribery\",\"authors\":\"P. Faliszewski, Pasin Manurangsi, Krzysztof Sornat\",\"doi\":\"10.1609/AAAI.V33I01.33011901\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the SHIFT-BRIBERY problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the voters’ preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.\",\"PeriodicalId\":8496,\"journal\":{\"name\":\"Artif. Intell.\",\"volume\":\"1 1\",\"pages\":\"103520\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artif. Intell.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1609/AAAI.V33I01.33011901\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artif. Intell.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/AAAI.V33I01.33011901","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

在SHIFT-BRIBERY问题中，我们给定一场选举，一个首选候选人，以及将这一首选候选人转移到选民偏好顺序上的成本。目标是找到这样一组变化，以确保受欢迎的候选人赢得选举。对于位置评分规则，我们给出了第一个多项式时间逼近格式，对于Copeland规则，我们给出了强不可逼近的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximation and Hardness of Shift-Bribery

In the SHIFT-BRIBERY problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the voters’ preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Artif. Intell.

自引率

0.00%

发文量