CANDIDATE STABILITY AND PROBABILISTIC VOTING PROCEDURES

We extend the analysis of Dutta, Jackson and Le Breton (Econometrica 2001) on strategic candidacy to probabilistic environments. For each configuration of the agenda and each profile of voters' preferences over running candidates a probabilistic voting procudure selects a lottery on the set of candidates at stake. Assuming that candidates cannot vote, we show that random dictatorships are the only unanimous probabilistic voting procedures that never provide unilateral incentives for the candidates to leave the ballot independently of the composition of the agenda. However, more flexible rules can be divised if we focus on the stability of specific agendas.