IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v27y2006i3p657-677.html
   My bibliography  Save this article

Candidate stability and probabilistic voting procedures

Author

Listed:
  • Carmelo Rodríguez-Álvarez

Abstract

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

Suggested Citation

  • Carmelo Rodríguez-Álvarez, 2006. "Candidate stability and probabilistic voting procedures," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 27(3), pages 657-677, April.
    • Handle: RePEc:spr:joecth:v:27:y:2006:i:3:p:657-677
    DOI: 10.1007/s00199-004-0564-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00199-004-0564-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00199-004-0564-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Matthew O. Jackson, 2001. "A crash course in implementation theory," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(4), pages 655-708.
    2. Kentaro Hatsumi, 2009. "Candidate Stable Voting Rules for Separable Orderings," ISER Discussion Paper 0735, Institute of Social and Economic Research, Osaka University.

    More about this item

    Keywords

    Probabilistic voting procedures; Candidate stability; Random dictatorship.;
    All these keywords.

    JEL classification:

    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.