IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2606.10845.html

Iterative Elimination of Borda Losers: Axiomatizations of the Baldwin and Nanson Rules

Author

Listed:
  • Leo Goto
  • Satoshi Nakada

Abstract

The Baldwin and Nanson rules are two voting rules proposed to identify the Condorcet winner whenever one exists. Both rules operate as recursive Borda elimination procedures: the Baldwin rule successively eliminates the alternatives with the lowest Borda score, whereas the Nanson rule eliminates all alternatives whose Borda scores do not exceed the mean. This paper investigates the axiomatic properties of the Baldwin and Nanson rules and provides unified axiomatic characterizations. In particular, our axioms are closely comparable to Young's (1974) characterization of the Borda rule.

Suggested Citation

  • Leo Goto & Satoshi Nakada, 2026. "Iterative Elimination of Borda Losers: Axiomatizations of the Baldwin and Nanson Rules," Papers 2606.10845, arXiv.org.
    • Handle: RePEc:arx:papers:2606.10845
    as

    Download full text from publisher

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

    More about this item

    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:2606.10845. 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.