IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2110.02298.html
   My bibliography  Save this paper

Tradeoffs in Hierarchical Voting Systems

Author

Listed:
  • Lucas Bottcher
  • Georgia Kernell

Abstract

Condorcet's jury theorem states that the correct outcome is reached in direct majority voting systems with sufficiently large electorates as long as each voter's independent probability of voting for that outcome is greater than 0.5. Yet, in situations where direct voting systems are infeasible, such as due to high implementation and infrastructure costs, hierarchical voting systems provide a reasonable alternative. We study differences in outcome precision between hierarchical and direct voting systems for varying group sizes, abstention rates, and voter competencies. Using asymptotic expansions of the derivative of the reliability function (or Banzhaf number), we first prove that indirect systems differ most from their direct counterparts when group size and number are equal to each other, and therefore to $\sqrt{N_{\rm d}}$, where $N_{\rm d}$ is the total number of voters in the direct system. In multitier systems, we prove that this difference is maximized when group size equals $\sqrt[n]{N_{\rm d}}$, where $n$ is the number of hierarchical levels. Second, we show that while direct majority rule always outperforms hierarchical voting for homogeneous electorates that vote with certainty, as group numbers and size increase, hierarchical majority voting gains in its ability to represent all eligible voters. Furthermore, when voter abstention and competency are correlated within groups, hierarchical systems often outperform direct voting, which we show by using a generating function approach that is able to analytically characterize heterogeneous voting systems.

Suggested Citation

  • Lucas Bottcher & Georgia Kernell, 2021. "Tradeoffs in Hierarchical Voting Systems," Papers 2110.02298, arXiv.org.
  • Handle: RePEc:arx:papers:2110.02298
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2110.02298
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2110.02298. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.