IDEAS home Printed from https://ideas.repec.org/h/spr/spbchp/978-3-030-12627-8_5.html
   My bibliography  Save this book chapter

The (In)Vulnerability of 20 Voting Procedures to the No-Show Paradox in a Restricted Domain

In: Voting Procedures Under a Restricted Domain

Author

Listed:
  • Dan S. Felsenthal
  • Hannu Nurmi

    (University of Turku)

Abstract

The No-Show paradox occurs whenever a group of identically-minded voters is better off abstaining than by voting according to its preferences. Moulin’s (Journal of Economic Theory 45:53–64, 1988) result states that if one wants to exclude the possibility of the No-Show paradox, one has to resort to procedures that do not necessarily elect the Condorcet winner when one exists. This paper examines 10 Condorcet-consistent and 10 Condorcet-non-consistent procedures in a restricted domain, viz., one where there exists a Condorcet winner who is elected in the original profile and the profile is subsequently modified by removing a group of voters with identical preferences. The question asked is whether the No-Show paradox can occur in these settings. It is found that only 2 of the 10 Condorcet-consistent procedures investigated (Minimax and Schwartz’s procedure) are invulnerable to the No-Show paradox, whereas only 3 of the 10 non-Condorcet-consistent ranked procedures investigated (Coombs’s, the Negative Plurality Elimination Rule, and the Majority Judgment procedures) are vulnerable to this paradox in the restricted domain. In other words, for a No-Show paradox to occur when using Condorcet-consistent procedures it is not, in general, necessary that a top Condorcet cycle exists in the original profile, while for this paradox to occur when using (ranked) non-Condorcet-consistent procedures it is, almost always, necessary that the original profile has a top cycle.

Suggested Citation

  • Dan S. Felsenthal & Hannu Nurmi, 2019. "The (In)Vulnerability of 20 Voting Procedures to the No-Show Paradox in a Restricted Domain," SpringerBriefs in Economics, in: Voting Procedures Under a Restricted Domain, chapter 0, pages 51-65, Springer.
    • Handle: RePEc:spr:spbchp:978-3-030-12627-8_5
    DOI: 10.1007/978-3-030-12627-8_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spbchp:978-3-030-12627-8_5. 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.