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

A New Method for Finding the Schulze Winner Set

Author

Listed:
  • Satoru Fujishige
  • Leo Goto
  • Satoshi Nakada

Abstract

We propose a new voting algorithm based on the pairwise majority-comparison matrix derived from voters' preference profiles. We show that this algorithm induces exactly the winner set of the Schulze rule (Schulze, 1997). Our algorithm successively eliminates weaker candidates in terms of all-pairs comparisons, thereby reflecting a dual spirit to Condorcet's original idea of splitting preference cycles (de Condorcet, 1785). We further show that the direct sum of the survival sets obtained at each elimination round coincides with the Schwartz set (Schwartz, 1972). These two equivalence results provide a formal mathematical foundation for the ``folklore'' relationship between the Schulze winner set and the Schwartz set, as well as a new Condorcetian interpretation of the Schulze winner set.

Suggested Citation

  • Satoru Fujishige & Leo Goto & Satoshi Nakada, 2026. "A New Method for Finding the Schulze Winner Set," Papers 2606.02213, arXiv.org, revised Jun 2026.
    • Handle: RePEc:arx:papers:2606.02213
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2606.02213
    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.02213. 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.