Sciweavers

AAAI
2015

Voting Rules As Error-Correcting Codes

7 years 11 months ago
Voting Rules As Error-Correcting Codes
We present the first model of optimal voting under adversarial noise. From this viewpoint, voting rules are seen as errorcorrecting 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.
Ariel D. Procaccia, Nisarg Shah 0001, Yair Zick
Added 12 Apr 2016
Updated 12 Apr 2016
Type Journal
Year 2015
Where AAAI
Authors Ariel D. Procaccia, Nisarg Shah 0001, Yair Zick
Comments (0)