IDEAS home Printed from https://ideas.repec.org/a/wsi/acsxxx/v03y2000i01n04ns0219525900000145.html
   My bibliography  Save this article

Computer simulations of voting systems

Author

Listed:
  • Dominique Lepelley

    (GEMMA-CREME, Faculté de sciences économiques et de gestion, Université de Caen, 14032 Caen Cedex, France)

  • Ahmed Louichi

    (GEMMA-CREME, Faculté de sciences économiques et de gestion, Université de Caen, 14032 Caen Cedex, France)

  • Fabrice Valognes

    (Université Notre Dame de Namur, Belgique)

Abstract

All voting procedures are susceptible to give rise, if not to paradoxes, at least to violations of some democratic principles. In this paper, we evaluate and compare the propensity of various voting rules -belonging to the class of scoring rules- to satisfy two versions of the majority principle. We consider the asymptotic case where the numbers of voters tends to infinity and, for each rule, we study with the help of Monte Carlo methods how this propensity varies as a function of the number of candidates.

Suggested Citation

  • Dominique Lepelley & Ahmed Louichi & Fabrice Valognes, 2000. "Computer simulations of voting systems," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 3(01n04), pages 181-194.
  • Handle: RePEc:wsi:acsxxx:v:03:y:2000:i:01n04:n:s0219525900000145
    DOI: 10.1142/S0219525900000145
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219525900000145
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0219525900000145?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 search for a different version of it.

    Citations

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


    Cited by:

    1. David McCune & Erin Martin & Grant Latina & Kaitlyn Simms, 2023. "A Comparison of Sequential Ranked-Choice Voting and Single Transferable Vote," Papers 2306.17341, arXiv.org.
    2. Mostapha Diss & Eric Kamwa, 2020. "Simulations in Models of Preference Aggregation," Post-Print hal-02424936, HAL.
    3. Diss, Mostapha & Dougherty, Keith & Heckelman, Jac C., 2023. "When ties are possible: Weak Condorcet winners and Arrovian rationality," Mathematical Social Sciences, Elsevier, vol. 123(C), pages 128-136.
    4. Eric Kamwa, 2019. "On the Likelihood of the Borda Effect: The Overall Probabilities for General Weighted Scoring Rules and Scoring Runoff Rules," Group Decision and Negotiation, Springer, vol. 28(3), pages 519-541, June.
    5. Benoît R. Kloeckner, 2022. "Cycles in synchronous iterative voting: general robustness and examples in Approval Voting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(2), pages 423-466, August.
    6. Eric Kamwa & Fabrice Valognes, 2017. "Scoring Rules and Preference Restrictions: The Strong Borda Paradox Revisited," Revue d'économie politique, Dalloz, vol. 127(3), pages 375-395.
    7. Harrison-Trainor, Matthew, 2022. "An analysis of random elections with large numbers of voters," Mathematical Social Sciences, Elsevier, vol. 116(C), pages 68-84.
    8. Mostapha Diss & Eric Kamwa, 2019. "Simulations in Models of Preference Aggregation," Working Papers hal-02424936, HAL.
    9. Eric Kamwa, 2018. "On the Likelihood of the Borda Effect: The Overall Probabilities for General Weighted Scoring Rules and Scoring Runoff Rules," Working Papers hal-01786590, HAL.
    10. Dougherty, Keith L. & Heckelman, Jac C., 2020. "The probability of violating Arrow’s conditions," European Journal of Political Economy, Elsevier, vol. 65(C).
    11. David McCune & Erin Martin & Grant Latina & Kaitlyn Simms, 2024. "A comparison of sequential ranked-choice voting and single transferable vote," Journal of Computational Social Science, Springer, vol. 7(1), pages 643-670, April.

    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:wsi:acsxxx:v:03:y:2000:i:01n04:n:s0219525900000145. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/acs/acs.shtml .

    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.