Election manipulation: the average case
Lists
Only you see this
Abstract
We review recent research on quantitative versions of the Gibbard-Satterthwaite theorem, which analyze the average-case manipulability of elections. The main message of these results is that computational hardness cannot hide manipulations completely. We conclude with open problems.
BibTeX
@article{mossel2012election,
author = {Elchanan Mossel and Miklós Z. Rácz},
title = {{Election manipulation: the average case}},
journal = {SIGecom Exch.},
year = {2012},
doi = {10.1145/2509002.2509007},
}Loading related content...