.png){kind=icon}
.png){kind=icon}
Return
Voting rules as error-correcting codes
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2015.10.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present the first model of optimal voting under adversarial noise. From this viewpoint, voting rules are seen as error-correcting codes: their goal is to correct errors in the input rankings and recover a ranking that is close to the ground truth. We derive worst-case bounds on the relation between the average accuracy of the input votes, and the accuracy of the output ranking. Empirical results from real data show that our approach produces significantly more accurate rankings than alternative approaches. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Social choice
Voting
Ground truth
Adversarial noise
Error-correcting codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W