Voting rules as error-correcting codes

DOI10.1016/J.ARTINT.2015.10.003MaRDI QIDQ899434zbMATH OpenOpenAlexFDO

Authors Ariel D. Procaccia, Nisarg Shah, Yair Zick

Publication date 28 December 2015

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2015.10.003

zbMATH Keywords

adversarial noiseerror-correcting codesground truthsocial choicevoting

Mathematics Subject Classification ID

Voting theory (91B12) Other types of codes (94B60)

Recommendations

• Voting rules as statistical estimators
• An algorithmic view of voting
• Eliciting a suitable voting rule via examples
• Independence of clones as a criterion for voting rules
• The learnability of voting rules

Cites work

• Average parameterization and partial kernelization for computing medians
• Codes in Permutations and Error Correction for Rank Modulation
• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• NON-NULL RANKING MODELS. I
• Social choice and individual values
• Toward efficient agnostic learning
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(7)

• Communication compatible voting rules
• Voting: a machine learning approach
• The voting algorithm is robust to various noise models
• Voting Rules from Random Relations
• Crowdvoting judgment: an analysis of modern peer review
• The benefits and limitations of voting mechanisms in evolutionary optimisation
• The range of collective accuracy for binary classifications under majority rule

This page was built for publication: Voting rules as error-correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899434)