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 agenda and each profile of voters’ preferences over running candidates, a probabilistic voting procedure selects a lottery on the set of running candidates. 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 withdraw their candidacy at any set of potential candidates. More flexible probabilistic voting procedures can be devised if we restrict our attention to the stability of specific sets of potential candidates. Copyright Springer-Verlag Berlin/Heidelberg 2006
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 27 (2006)
Issue (Month): 3 (04)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:27:y:2006:i:3:p:657-677. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.