Election manipulation: the average case
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.