Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
The requirement that a voting procedure be immune to the strategic withdrawal of a candidate for election can be formalized in different ways. Dutta, Jackson, and Le Breton (Econometrica, 2001) have recently shown that two formalizations of this candidate stability property are incompatible with some other desirable properties of voting procedures. This article shows that Grether and Plott's nonbinary generalization of Arrow's Theorem can be used to provide simple proofs of two of their impossibility theorems. Copyright Springer-Verlag Berlin Heidelberg 2003