We show that the Copeland solution is equivalent to the minisum principle which requires to choose the candidate(s) who beat all remaining contenders in the smallest total number of steps.

We give a complete characterization of preference domains over which the plurality rule is Nash implementable. We show that the plurality rule fails Nash implementability on every domain except those which are "monotonically trivial".