View source for Schulze method

[[Category:Articles with example pseudocode]]
[[Category:Debian]]
[[Category:Electoral systems]]
[[Category:Monotonic Condorcet methods]]
[[Category:Single-winner electoral systems]]
{{Short description|Single-winner electoral system}}
{{Electoral systems sidebar|expanded=Single-winner}}
The '''Schulze method''' ({{IPAc-en|ˈ|ʃ|ʊ|l|t|s|ə}}), also known as the '''beatpath method''', is a [[single winner]] [[Ranked voting|ranked-choice voting rule]] developed by Markus Schulze. The Schulze method is a [[Condorcet method|Condorcet completion method]], which means it will elect a [[majority-preferred candidate]] if one exists. In other words, if most people rank ''A'' above ''B'', ''A'' will defeat ''B'' (whenever this is possible). Schulze's method breaks [[Cyclic tie|cyclic ties]] by using indirect victories. The idea is that if [[Alice and Bob|Alice]] beats Bob, and Bob beats Charlie, then Alice (indirectly) beats Charlie; this kind of indirect win is called a [[Beatpath|''beatpath'']].

For [[proportional representation]], a [[single transferable vote]] (STV) variant known as [[Schulze STV]] also exists. The Schulze method is used by several organizations including [[Debian]], [[Ubuntu (operating system)|Ubuntu]], [[Gentoo Linux|Gentoo]], [[Pirate Party]] political parties and [[Schulze method#Usage|many others]]. It was also used by [[Wikimedia]] prior to their adoption of [[score voting]].

== Description of the method ==
[[File:Preferential_ballot.svg|right|thumb|181x181px|A sample ballot asking voters to order candidates by preference]]
Schulze's method uses [[Ranked ballot|ranked ballots]] with equal ratings allowed. There are two common (equivalent) descriptions of Schulze's method.

=== Beatpath explanation ===
The idea behind Schulze's method is that if [[Alice and Bob|Alice]] defeats Bob, and Bob beats Charlie, then Alice "indirectly" defeats Charlie. These chained sequences of "beats" are called 'beatpaths'.

Every beatpath is assigned a particular ''strength''. The strength of a single-step beatpath from Alice to Bob is just the number of voters who rank Alice over Bob. For a longer beatpath, consisting of multiple beats, a beatpath is as strong as its weakest link (i.e. the beat with the smallest number of winning votes).

We say Alice has a "beatpath-win" over Bob if her strongest beatpath to Bob is stronger than all of Bob's strongest beatpath to Alice. The winner is the candidate who has a beatpath-win over every other candidate.

Markus Schulze proved that this definition of a beatpath-win is [[Transitive relation|transitive]]: in other words, if Alice has a beatpath-win over Bob, and Bob has a beatpath-win over Charlie, Alice has a beatpath-win over Charlie.<ref name="schulze201122">Markus Schulze, "[[doi:10.1007/s00355-010-0475-4|A new monotonic, clone-independent, reversal symmetric, and Condorcet-consistent single-winner election method]]", Social Choice and Welfare, volume 36, number 2, page 267–303, 2011. Preliminary version in ''Voting Matters'', 17:9-19, 2003.</ref>{{rp|§4.1}} As a result, the Schulze method is a [[Condorcet method]], providing a full extension of the [[majority rule]] to any set of ballots.

=== Iterative description ===
The Schulze winner can also be constructed iteratively, using a defeat-dropping method:

# Draw a [[directed graph]] with all the candidates as nodes; label the edges with the number of votes supporting the winner.
# If there is more than one candidate left:
#* Check if any candidates are tied (and if so, break the ties by [[random ballot]]).
#* Eliminate all candidates outside the [[Schwartz set|majority-preferred set]].
#* Delete the edge closest to being tied.

The winner is the only candidate left at the end of the procedure.

== Example ==
In the following example 45 voters rank 5 candidates.
{| class="wikitable"
!Number of voters
!Order of preference
|-
|5
|ACBED
|-
|5
|ADECB
|-
|8
|BEDAC
|-
|3
|CABED
|-
|7
|CAEBD
|-
|2
|CBADE
|-
|7
|DCEBA
|-
|8
|EBADC
|}
The pairwise preferences have to be computed first. For example, when comparing ''{{mvar|A}}'' and ''{{mvar|B}}'' pairwise, there are {{math|1=5+5+3+7=20}} voters who prefer ''{{mvar|A}}'' to ''{{mvar|B}}'', and {{math|1=8+2+7+8=25}} voters who prefer ''{{mvar|B}}'' to ''{{mvar|A}}''. So <math>d[A, B] = 20</math> and <math>d[B, A] = 25</math>. The full set of pairwise preferences is:
[[File:Schulze_method_example1.svg|right|thumb|300x300px|[[Directed graph]] labeled with pairwise preferences d[*, *] ]]
{| class="wikitable" style="text-align:center"
|+ Matrix of pairwise preferences
|-
! !! <math>d[*,A]</math> !! <math>d[*,B]</math> !! <math>d[*,C]</math> !! <math>d[*,D]</math> !! <math>d[*,E]</math>
|-
! <math>d[A,*]</math>
| || style="background:#fdd;"|20 || style="background:#dfd;"|26 || style="background:#dfd;"|30 || style="background:#fdd;"|22
|-
! <math>d[B,*]</math>
| style="background:#dfd;"|25 || || style="background:#fdd;"|16 || style="background:#dfd;"|33 || style="background:#fdd;"|18
|-
! <math>d[C,*]</math>
| style="background:#fdd;"|19 || style="background:#dfd;"|29 || || style="background:#fdd;"|17 || style="background:#dfd;"|24
|-
! <math>d[D,*]</math>
| style="background:#fdd;"|15 || style="background:#fdd;"|12 || style="background:#dfd;"|28 || || style="background:#fdd;"|14
|-
! <math>d[E,*]</math>
| style="background:#dfd;"|23 || style="background:#dfd;"|27 || style="background:#fdd;"|21 || style="background:#dfd;"|31 || 
|}
The cells for d[X, Y] have a light green background if d[X, Y] > d[Y, X], otherwise the background is light red. There is no undisputed winner by only looking at the pairwise differences here.

Now the strongest paths have to be identified. To help visualize the strongest paths, the set of pairwise preferences is depicted in the diagram on the right in the form of a [[directed graph]].  An arrow from the node representing a candidate X to the one representing a candidate Y is labelled with d[X, Y].  To avoid cluttering the diagram, an arrow has only been drawn from X to Y when d[X, Y] > d[Y, X] (i.e. the table cells with light green background), omitting the one in the opposite direction (the table cells with light red background).

One example of computing the strongest path strength is p[B, D] = 33: the strongest path from B to D is the direct path (B, D) which has strength 33. But when computing p[A, C], the strongest path from A to C is not the direct path (A, C) of strength 26, rather the strongest path is the indirect path (A, D, C) which has strength min(30, 28) = 28. The ''strength'' of a path is the strength of its weakest link.

For each pair of candidates X and Y, the following table shows the strongest path from candidate X to candidate Y in red, with the weakest link underlined.{{clear}}
{| class="wikitable" style="text-align:center"
|+ Strongest paths
|-
! {{diagonal split header|From|To}}
! A !! B !! C !! D !! E
!
|-
! A
| {{n/a}} || [[Image:Schulze method example1 AB.svg|border|none|150px]] A-(30)-D-<u>(28)</u>-C-(29)-B || [[Image:Schulze method example1 AC.svg|border|none|150px]] A-(30)-D-<u>(28)</u>-C || [[Image:Schulze method example1 AD.svg|border|none|150px]] A-<u>(30)</u>-D || [[Image:Schulze method example1 AE.svg|border|none|150px]] A-(30)-D-(28)-C-<u>(24)</u>-E
! A
|-
! B
| [[Image:Schulze method example1 BA.svg|border|none|150px]] B-<u>(25)</u>-A || {{n/a}} || [[Image:Schulze method example1 BC.svg|border|none|150px]] B-(33)-D-<u>(28)</u>-C || [[Image:Schulze method example1 BD.svg|border|none|150px]] B-<u>(33)</u>-D || [[Image:Schulze method example1 BE.svg|border|none|150px]] B-(33)-D-(28)-C-<u>(24)</u>-E
! B
|-
! C
| [[Image:Schulze method example1 CA.svg|border|none|150px]] C-(29)-B-<u>(25)</u>-A || [[Image:Schulze method example1 CB.svg|border|none|150px]] C-<u>(29)</u>-B || {{n/a}} || [[Image:Schulze method example1 CD.svg|border|none|150px]] C-<u>(29)</u>-B-(33)-D || [[Image:Schulze method example1 CE.svg|border|none|150px]] C-<u>(24)</u>-E
! C
|-
! D
| [[Image:Schulze method example1 DA.svg|border|none|150px]] D-(28)-C-(29)-B-<u>(25)</u>-A || [[Image:Schulze method example1 DB.svg|border|none|150px]] D-<u>(28)</u>-C-(29)-B || [[Image:Schulze method example1 DC.svg|border|none|150px]] D-<u>(28)</u>-C || {{n/a}} || [[Image:Schulze method example1 DE.svg|border|none|150px]] D-(28)-C-<u>(24)</u>-E
! D
|-
! E
| [[Image:Schulze method example1 EA.svg|border|none|150px]] E-(31)-D-(28)-C-(29)-B-<u>(25)</u>-A || [[Image:Schulze method example1 EB.svg|border|none|150px]] E-(31)-D-<u>(28)</u>-C-(29)-B || [[Image:Schulze method example1 EC.svg|border|none|150px]] E-(31)-D-<u>(28)</u>-C || [[Image:Schulze method example1 ED.svg|border|none|150px]] E-<u>(31)</u>-D || {{n/a}}
! E
|-
!
! A !! B !! C !! D !! E
! {{diagonal split header|To|From}}
|}

{| class="wikitable" style="text-align:center"
|+Strengths of the strongest paths
|-
! !! <math>p[*,A]</math> !! <math>p[*,B]</math> !! <math>p[*,C]</math> !! <math>p[*,D]</math> !! <math>p[*,E]</math>
|-
! <math>p[A,*]</math>
| || style="background:#dfd;"|28 || style="background:#dfd;"|28 || style="background:#dfd;"|30 || style="background:#fdd;"|24
|-
! <math>p[B,*]</math>
| style="background:#fdd;"|25 || || style="background:#fdd;"|28 || style="background:#dfd;"|33 || style="background:#fdd;"|24
|-
! <math>p[C,*]</math>
| style="background:#fdd;"|25 || style="background:#dfd;"|29 || || style="background:#dfd;"|29 || style="background:#fdd;"|24
|-
! <math>p[D,*]</math>
| style="background:#fdd;"|25 || style="background:#fdd;"|28 || style="background:#fdd;"|28 || || style="background:#fdd;"|24
|-
! <math>p[E,*]</math>
| style="background:#dfd;"|25 || style="background:#dfd;"|28 || style="background:#dfd;"|28 || style="background:#dfd;"|31 || 
|}
Now the output of the Schulze method can be determined. For example, when comparing ''{{mvar|A}}'' and ''{{mvar|B}}'', since <math>(28 =) p[A,B] > p[B,A] (= 25)</math>, for the Schulze method candidate ''{{mvar|A}}'' is ''better'' than candidate ''{{mvar|B}}''. Another example is that <math>(31 =) p[E,D] > p[D,E] (= 24)</math>, so candidate E is ''better'' than candidate D. Continuing in this way, the result is that the Schulze ranking is <math>E > A > C > B > D</math>, and ''{{mvar|E}}'' wins. In other words, ''{{mvar|E}}'' wins since <math>p[E,X] \ge p[X,E]</math> for every other candidate X.

== Implementation ==
The only difficult step in implementing the Schulze method is computing the strongest path strengths. However, this is a well-known problem in graph theory sometimes called the [[widest path problem]]. One simple way to compute the strengths, therefore, is a variant of the [[Floyd–Warshall algorithm]]. The following [[pseudocode]] illustrates the algorithm.<syntaxhighlight line="" lang="text">
# Input: d[i,j], the number of voters who prefer candidate i to candidate j.
# Output: p[i,j], the strength of the strongest path from candidate i to candidate j.

for i from 1 to C
    for j from 1 to C
        if i ≠ j then
            if d[i,j] > d[j,i] then
                p[i,j] := d[i,j]
            else
                p[i,j] := 0

for i from 1 to C
    for j from 1 to C
        if i ≠ j then
            for k from 1 to C
                if i ≠ k and j ≠ k then
                    p[j,k] := max (p[j,k], min (p[j,i], p[i,k]))
</syntaxhighlight>This algorithm is [[P (complexity)|efficient]] and has [[Time complexity|running time]] [[Big O notation|O(''C''<sup>3</sup>)]] where ''C'' is the number of candidates.

== Ties and alternative implementations ==
When allowing users to have ties in their preferences, the outcome of the Schulze method naturally depends on how these ties are interpreted in defining d[*,*]. Two natural choices are that d[A, B] represents either the number of voters who strictly prefer A to B (A>B), or the ''margin'' of (voters with A>B) minus (voters with B>A). But no matter how the ''d''s are defined, the Schulze ranking has no cycles, and assuming the ''d''s are unique it has no ties.<ref name="schulze20113">Markus Schulze, "[[doi:10.1007/s00355-010-0475-4|A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method]]", Social Choice and Welfare, volume 36, number 2, page 267–303, 2011. Preliminary version in ''Voting Matters'', 17:9-19, 2003.</ref>

Although ties in the Schulze ranking are unlikely, they are possible. Schulze's original paper recommended breaking ties by [[random ballot]].<ref name="schulze20113" />

There is another alternative way to ''demonstrate'' the winner of the Schulze method. This method is equivalent to the others described here, but the presentation is optimized for the significance of steps being ''visually apparent'' as a human goes through it, not for computation.

# Make the results table, called the "matrix of pairwise preferences", such as used above in the example. Then, every positive number is a pairwise win for the candidate on that row (and marked green), ties are zeroes, and losses are negative (marked red). Order the candidates by how long they last in elimination.
# If there is a candidate with no red on their line, they win.
# Otherwise, draw a square box around the Schwartz set in the upper left corner. It can be described as the minimal "winner's circle" of candidates who do not lose to anyone outside the circle. Note that to the right of the box there is no red, which means it is a winner's circle, and note that within the box there is no reordering possible that would produce a smaller winner's circle.
# Cut away every part of the table outside the box.
# If there is still no candidate with no red on their line, something needs to be compromised on; every candidate lost some race, and the loss we tolerate the best is the one where the loser obtained the most votes. So, take the red cell with the highest number (if going by margins, the least negative), make it green—or any color other than red—and go back step 2.

Here is a margins table made from the above example. Note the change of order used for demonstration purposes.
{| class="wikitable" style="text-align:center"
|+ Initial results table
|-
! !! E !! A !! C !! B !! D
|-
! E
| || style="background:#dfd;"|1 || style="background:#fdd;"|−3 || style="background:#dfd;"|9 || style="background:#dfd;"|17
|-
! A
| style="background:#fdd;"|−1 || || style="background:#dfd;"|7 || style="background:#fdd;"|−5 || style="background:#dfd;"|15
|-
! C
| style="background:#dfd;"|3 || style="background:#fdd;"|−7 || || style="background:#dfd;"|13 || style="background:#fdd;"|−11
|-
! B
| style="background:#fdd;"|−9 || style="background:#dfd;"|5 || style="background:#fdd;"|−13 || || style="background:#dfd;"|21
|-
! D
| style="background:#fdd;"|−17 || style="background:#fdd;"|−15 || style="background:#dfd;"|11 || style="background:#fdd;"|−21 || 
|}
The first drop (A's loss to E by 1 vote) does not help shrink the Schwartz set.
{| class="wikitable" style="text-align:center"
|+ First drop
|-
! !! E !! A !! C !! B !! D
|-
! E
| || style="background:#dfd;"|1 || style="background:#fdd;"|−3 || style="background:#dfd;"|9 || style="background:#dfd;"|17
|-
! A
| style="background:#ddd;"|−1 || || style="background:#dfd;"|7 || style="background:#fdd;"|−5 || style="background:#dfd;"|15
|-
! C
| style="background:#dfd;"|3 || style="background:#fdd;"|−7 || || style="background:#dfd;"|13 || style="background:#fdd;"|−11
|-
! B
| style="background:#fdd;"|−9 || style="background:#dfd;"|5 || style="background:#fdd;"|−13 || || style="background:#dfd;"|21
|-
! D
| style="background:#fdd;"|−17 || style="background:#fdd;"|−15 || style="background:#dfd;"|11 || style="background:#fdd;"|−21 || 
|}
So we get straight to the second drop (E's loss to C by 3 votes), and that shows us the winner, E, with its clear row.
{| class="wikitable" style="text-align:center"
|+ Second drop, final
|-
! !! E !! A !! C !! B !! D
|-
! E
| || style="background:#efe;"|1 || style="background:#eee;"|−3 || style="background:#efe;"|9 || style="background:#efe;"|17
|-
! A
| style="background:#ddd;"|−1 || || style="background:#dfd;"|7 || style="background:#fdd;"|−5 || style="background:#dfd;"|15
|-
! C
| style="background:#dfd;"|3 || style="background:#fdd;"|−7 || || style="background:#dfd;"|13 || style="background:#fdd;"|−11
|-
! B
| style="background:#fdd;"|−9 || style="background:#dfd;"|5 || style="background:#fdd;"|−13 || || style="background:#dfd;"|21
|-
! D
| style="background:#fdd;"|−17 || style="background:#fdd;"|−15 || style="background:#dfd;"|11 || style="background:#fdd;"|−21 || 
|}

This method can also be used to calculate a result, if the table is remade in such a way that one can conveniently and reliably rearrange the order of the candidates on both the row and the column, with the same order used on both at all times.

== Satisfied and failed criteria ==
=== Satisfied criteria ===
The Schulze method satisfies the following criteria:
{{div col|colwidth=30em}}{{rp}}
* [[Monotonicity criterion]]<ref name="schulze2011">Markus Schulze, "[https://doi.org/10.1007/s00355-010-0475-4 A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method]", Social Choice and Welfare, volume 36, number 2, page 267–303, 2011. Preliminary version in ''Voting Matters'', 17:9-19, 2003.</ref>{{rp|§4.5}}
* [[Majority favorite criterion|Majority criterion]]
* [[Majority loser criterion]]
* [[Condorcet criterion]]
* [[Condorcet loser criterion]]
* [[Smith criterion]]<ref name=schulze2011 />{{rp|§4.7}}
* [[Independence of Smith-dominated alternatives]]<ref name=schulze2011 />{{rp|§4.7}}
* [[Mutual majority criterion]]
* [[Independence of clones criterion|Independence of clones]]<ref name=schulze2011 />{{rp|§4.6}}
* [[Reversal symmetry]]<ref name=schulze2011 />{{rp|§4.4}}
* Mono-append<ref name="woodall1994">Douglas R. Woodall, [http://www.votingmatters.org.uk/ISSUE3/P5.HTM Properties of Preferential Election Rules], ''Voting Matters'', issue 3, pages 8–15, December 1994</ref>
* Mono-add-plump<ref name=woodall1994/>
* [[Resolvability criterion]]<ref name=schulze2011 />{{rp|§4.2}}
* [[Polynomial time|Polynomial runtime]]<ref name=schulze2011 />{{rp|§2.3"}}
* prudence<ref name=schulze2011 />{{rp|§4.9"}}
* MinMax sets<ref name=schulze2011 />{{rp|§4.8"}}
* [[Plurality criterion|Woodall's plurality criterion]] if [[Condorcet method#Defeat strength|winning votes]] are used for d[X,Y]
* Symmetric-completion<ref name=woodall1994/> if [[Condorcet method#Defeat strength|margins]] are used for d[X,Y]
{{div col end}}

=== Failed criteria ===
Since the Schulze method satisfies the Condorcet criterion, it automatically fails the following criteria:

* [[Participation criterion|Participation]]<ref name="schulze20113" />{{rp|§3.4}}
* [[Consistency criterion|Consistency]]
* [[Tactical voting#Burying|Invulnerability to burying]]
* [[Later-no-harm criterion|Later-no-harm]]

Likewise, since the Schulze method is not a [[Dictatorship mechanism|dictatorship]] and is a [[ranked voting]] system (not [[Rated voting|rated]]), [[Arrow's Theorem]] implies it fails [[independence of irrelevant alternatives]], meaning it can be vulnerable to the [[spoiler effect]] in some rare circumstances. The Schulze method also fails [[Peyton Young]]'s criterion of [[Local independence of irrelevant alternatives|Local Independence of Irrelevant Alternatives]].

=== Comparison table ===
The following table compares the Schulze method with other single-winner election methods:
{{Comparison of Schulze to preferential voting systems}}

=== Difference from ranked pairs ===
[[Ranked pairs]] is another [[Condorcet method]] which is very similar to Schulze's rule, and typically produces the same outcome. There are slight differences, however. The main difference between the beatpath method and [[ranked pairs]] is that Schulze retains behavior closer to [[Minimax Condorcet method|minimax]]. Say that the [[Minimax Condorcet method|minimax]] score of a set '''X''' of candidates is the strength of the strongest pairwise win of a candidate A ∉ '''X''' against a candidate B ∈ '''X'''. Then the Schulze method, but not ranked pairs, guarantees the winner is always a candidate of the set with minimum minimax score.<ref name="schulze20113" />{{rp|§4.8}} This is the sense in which the Schulze method minimizes the largest majority that has to be reversed when determining the winner.

On the other hand, Ranked Pairs minimizes the largest majority that has to be reversed to determine the order of finish.<ref>Tideman, T. Nicolaus, "Independence of clones as a criterion for voting rules", Social Choice and Welfare vol 4 #3 (1987), pp. 185–206.</ref> In other words, when Ranked Pairs and the Schulze method produce different orders of finish, for the majorities on which the two orders of finish disagree, the Schulze order reverses a larger majority than the Ranked Pairs order.

== History ==
The Schulze method was developed by Markus Schulze in 1997. It was first discussed in public mailing lists in 1997–1998<ref>See:

* Markus Schulze, [http://lists.electorama.com/pipermail/election-methods-electorama.com/1997-October/001570.html Condorect sub-cycle rule], October 1997
* Mike Ossipoff, [http://lists.electorama.com/pipermail/election-methods-electorama.com/1998-July/099943.html Party List P.S.], July 1998
* Markus Schulze, [http://lists.electorama.com/pipermail/election-methods-electorama.com/1998-August/100045.html Tiebreakers, Subcycle Rules], August 1998
* Markus Schulze, [http://lists.electorama.com/pipermail/election-methods-electorama.com/1998-August/100131.html Maybe Schulze is decisive],  August 1998
* Norman Petry, [http://lists.electorama.com/pipermail/election-methods-electorama.com/1998-September/067383.html Schulze Method - Simpler Definition], September 1998
* Markus Schulze, [http://lists.electorama.com/pipermail/election-methods-electorama.com/1998-November/068099.html Schulze Method], November 1998</ref> and in 2000.<ref>See:

* Anthony Towns, [https://lists.debian.org/debian-vote/2000/11/msg00121.html Disambiguation of 4.1.5], November 2000
* Norman Petry, [https://lists.debian.org/debian-vote/2000/12/msg00045.html Constitutional voting, definition of cumulative preference], December 2000</ref> In 2011, Schulze published the method in the academic journal ''[[Social Choice and Welfare]]''.<ref name="schulze20113" />

== Usage ==
[[File:Voting2.png|right|thumb|Sample ballot for [[Wikimedia Foundation|Wikimedia's Board of Trustees]] elections]]

=== Government ===
The Schulze method is used by the city of [[Silla, Valencia|Silla]] for all referendums.<ref>{{Cite web |last=Hortanoticias |first=Redacción |date=2016-02-23 |title=Al voltant de 2.000 participants en dos dies en la primera enquesta popular de Silla que decidirà sobre espectacles taurins |url=https://www.hortanoticias.com/al-voltant-de-2-000-participants-en-dos-dies-en-la-primera-enquesta-popular-de-silla-que-decidira-sobre-espectacles-taurins/ |access-date=2022-09-24 |website=Hortanoticias.com |language=es}}</ref><ref>{{Cite web |last=Silla |first=~ El Cresol de |date=2016-05-26 |title=Un any d'aprofundiment democràtic a Silla |url=https://elcresoldesilla.wordpress.com/2016/05/26/un-any-daprofundiment-democratic-a-silla/ |access-date=2022-09-24 |website=El Cresol de Silla |language=ca}}</ref> It is also used by the cities of [[Turin]] and [[San Donà di Piave]] and by the [[London Borough of Southwark]] through their use of the WeGovNow platform, which in turn uses the [[LiquidFeedback]] decision tool.{{citation needed|date=September 2023}}

=== Political parties ===
Schulze was adopted by the [[Pirate Party of Sweden]] (2009),<ref name="PiratePartySweden2">See:

* {{cite web |date=8 October 2009 |title=Inför primärvalen |trans-title=Before the primary elections |url=https://forum.piratpartiet.se/showthread.php?p=172218 |archive-url=https://archive.today/20121224194036/https://forum.piratpartiet.se/showthread.php?p=172218 |archive-date=24 December 2012 |language=sv}}
* {{cite web |date=17 October 2009 |title=Dags att kandidera till riksdagen |trans-title=Time to run for the Riksdag |url=https://forum.piratpartiet.se/showthread.php?p=173792 |archive-url=https://archive.today/20140723081035/https://forum.piratpartiet.se/showthread.php?p=173792 |archive-date=23 July 2014 |language=sv}}
* {{cite web |date=19 January 2010 |title=Råresultat primärvalet |trans-title=The raw result of the primary election |url=https://forum.piratpartiet.se/showthread.php?p=190840 |archive-url=https://archive.today/20121224195649/https://forum.piratpartiet.se/showthread.php?p=190840 |archive-date=24 December 2012 |language=sv}}</ref> and the [[Pirate Party Germany|Pirate Party of Germany]] (2010).<ref name="PiratePartyGermany2">11 of the 16 regional sections and the federal section of the [[Pirate Party Germany|Pirate Party of Germany]] are using [https://liquidfeedback.org/ LiquidFeedback] for unbinding internal opinion polls. In 2010/2011, the Pirate Parties of [[Neukölln]] ([http://wiki.piratenpartei.de/BE:Neuk%C3%B6lln/Gebietsversammlungen/2010.3/Protokoll link]), [[Mitte]] ([https://berlin.piratenpartei.de/innerparteiliches/kandidaten-der-piraten-in-mitte-aufgestellt/ link]), [[Steglitz-Zehlendorf]] ([http://wiki.piratenpartei.de/wiki/images/d/da/BE_Gebietsversammlung_Steglitz_Zehlendorf_2011_01_20_Protokoll.pdf link]), [[Lichtenberg]] ([http://piraten-lichtenberg.de/2011/02/02/groser-schritt-in-richtung-wahl/ link]), and [[Tempelhof-Schöneberg]] ([http://wiki.piratenpartei.de/BE:Gebietsversammlungen/Tempelhof-Schoeneberg/Protokoll_2011.1 link]) adopted the Schulze method for its primaries. Furthermore, the Pirate Party of [[Berlin]] (in 2011) ([http://wiki.piratenpartei.de/BE:Parteitag/2011.1/Protokoll link]) and the Pirate Party of [[Regensburg]] (in 2012) ([http://wiki.piratenpartei.de/BY:Regensburg/Gr%C3%BCndung/Gesch%C3%A4ftsordnung#Anlage_A link]) adopted this method for their primaries.</ref> The [[Boise, Idaho]] chapter of the [[Democratic Socialists of America]] in February chose this method for their first special election held in March 2018.<ref name="Boise DSA2">{{Cite web |last=Chumich |first=Andrew |title=DSA Special Election |url=https://www.boisedsa.org/statements/yjmtibx8okazm7i7042c10tuld0gm5 |access-date=2018-02-25}}</ref>

* [[Five Star Movement]] of [[Campobasso]],<ref>[http://www.quotidianomolise.com/campobasso-comunali-scattano-le-primarie-a-5-stelle/ Campobasso. Comunali, scattano le primarie a 5 Stelle], February 2014</ref> [[Fondi]],<ref>{{Cite web |last=Macaro |first=Mirko |date=2015-03-03 |title=Fondi, il punto sui candidati a sindaco. Certezze, novità e colpi di scena |url=https://www.h24notizie.com/2015/03/03/fondi-punto-sui-candidati-sindaco-certezze-novita-colpi-scena/ |access-date=2022-09-24 |website=h24 notizie - portale indipendente di news dalla provincia |language=it-IT}}</ref> [[Monte Compatri]],<ref>article 25(5) of the [http://www.5stellemontecompatri.it/wp-content/uploads/2013/11/REGOLAMENTO-M5S-Montecompatri1.doc bylaws], October 2013</ref> [[Montemurlo]],<ref>{{Cite web |date=November 2013 |title=MoVimento 5 Stelle - Montemurlo: 2° Step Comunarie di Montemurlo |url=http://www.montemurlo5stelle.net/2013/11/2-step-comunarie-di-montemurlo.html |archive-url=https://web.archive.org/web/20150402230827/http://www.montemurlo5stelle.net/2013/11/2-step-comunarie-di-montemurlo.html |archive-date=2015-04-02 |access-date=2022-09-24}}</ref> [[Pescara]],<ref>article 12 of the [http://movimento5stellepescara.it/wp-content/uploads/2015/02/Regolamento-m5S-pescara_rev.03_del_30_01_-2015.pdf bylaws], January 2015</ref> and [[San Cesareo]]<ref>[https://www.meetup.com/MoVimento-5-Stelle-San-Cesareo/events/166108572/ Ridefinizione della lista di San Cesareo con Metodo Schulze], February 2014</ref>
* [[Pirate Party|Pirate Parties]] of [[Pirate Party Australia|Australia]],<ref>{{Cite web |date=18 November 2011 |title=National Congress 2011 Results – Pirate Party Australia |url=https://pirateparty.org.au/2011/11/18/national-congress-2011-results/ |access-date=2022-09-24 |website=pirateparty.org.au |language=en-US}}</ref> [[Pirate Party of Austria|Austria]],<ref>§6(10) of the [http://wiki.piratenpartei.at/wiki/Satzung bylaws]</ref> [[Pirate Party (Belgium)|Belgium]],<ref>Article III.3.4 of the Statutory Rules ([https://wiki.pirateparty.be/images/9/9f/Ppbe-statutes-fr_be.pdf french], [https://wiki.pirateparty.be/images/e/e7/Ppbe-statutes-nl_be.pdf dutch])</ref> [[Pirate Party of Brazil|Brazil]], [[Pirate Party Germany|Germany]],<ref name="PiratePartyGermany2" /> [[Pirate Party (Iceland)|Iceland]],<ref>{{Cite web |last=Píratar |date=2013-10-23 |title=Schulze aðferðin |url=https://piratar.is/frettir/piratafraedarinn/schulze-adferdin/ |access-date=2022-09-24 |website=Píratar |language=is}}</ref> [[Pirate Party (Italy)|Italy]],<ref>[https://www.partito-pirata.it/statute/ Rules adopted on 18 December 2011]</ref> [[Pirate Party of the Netherlands|the Netherlands]],<ref>{{Cite web |last=Pontier |first=Matthijs |date=2015-01-11 |title=Verslag ledenraadpleging 4 januari |url=https://noord-holland.piratenpartij.nl/711/ |access-date=2022-09-24 |website=Piratenpartij Noord Holland |language=nl}}</ref> [[Pirate Party of Sweden|Sweden]],<ref name="PiratePartySweden2" /> [[Pirate Party Switzerland|Switzerland]],<ref>{{Cite web |last=Pankerl |first=Florian |date=2010-09-18 |title=Piratenversammlung der Piratenpartei Schweiz 2010 – Samstag |url=https://blog.florian-pankerl.de/2010/piratenversammlung-der-piratenpartei-schweiz-2010-samstag/ |access-date=2022-09-24 |language=de}}</ref> and [[United States Pirate Party|the United States]]<ref>article IV section 3 of the [https://wiki.uspirates.org/w/index.php?title=Pirate_National_Committee_(PNC)/Bylaws bylaws], July 2012</ref>
* SustainableUnion<ref>§10 III of its [http://sustainableunion.yolasite.com/resources/130614_Satzung_sud_fBayern.pdf bylaws], June 2013</ref>
* [[Volt Europe]]<ref>{{cite web |author=The Board of Directors of Volt Europe in Spain |title=Algunas consideraciones sobre en qué grupo estará Volt Europa en el Parlamento Europeo |trans-title=Some considerations on which group Volt Europe will join in the European Parliament |url=https://medium.com/volt-espa%C3%B1a/algunas-consideraciones-sobre-en-qu%C3%A9-grupo-estar%C3%A1-volt-europa-en-el-parlamento-europeo-b10b7431d947 |archive-url=https://archive.today/20240820145337/https://web.archive.org/web/20211113112113/https://medium.com/volt-espa%C3%B1a/algunas-consideraciones-sobre-en-qu%C3%A9-grupo-estar%C3%A1-volt-europa-en-el-parlamento-europeo-b10b7431d947 |archive-date=20 August 2024 |website=[[Medium (website)|Medium]] |language=es}}</ref>

=== Student government and associations ===

* [[Association des États Généraux des Étudiants de l'Europe|AEGEE – European Students' Forum]]<ref>{{Cite web |last=Hajdu |first=Tekla |date=2017-09-24 |title=The Schulze Method – Agora 101 |url=https://www.zeus.aegee.org/magazine/2017/09/24/the-schulze-method-agora-101/ |access-date=2022-09-24 |website=The AEGEEan - AEGEE's online magazine - AEGEE-Europe |language=en-GB}}</ref>
* Club der Ehemaligen der Deutschen SchülerAkademien e. V.<ref>[https://db.cde-ev.de/doc/Realm_Assembly_Voting-Details.html Voting Details], January 2021</ref>
* Associated Student Government at [[École normale supérieure (Paris)|École normale supérieure de Paris]]<ref>[https://www.dg.ens.fr/documents/148/note_explicative.pdf Référendum sur la réforme du thurnage], June 2021</ref>
* Flemish Society of Engineering Students Leuven<ref>article 57 of the [https://www.vtk.be/page/file/ef87370c1d5798758d1730a14f7410d96783301e/ statutory rules]</ref>
* Graduate Student Organization at the State University of New York: Computer Science (GSOCS)<ref>{{cite web |title=User Voting Instructions |url=http://gso.cs.binghamton.edu/index.php/Voting |url-status=dead |archive-url=https://web.archive.org/web/20130909055056/http://gso.cs.binghamton.edu/index.php/Voting |archive-date=2013-09-09 |access-date=2010-05-08 |publisher=Gso.cs.binghamton.edu}}</ref>
* [[Hillegass Parker House]]<ref>{{cite web |title=Hillegass-Parker House Bylaws § 5. Elections |url=https://sites.google.com/a/bsc.coop/hip-house/bylaws-and-policies/bylaws-bylaw-appendix |access-date=4 October 2015 |work=Hillegass-Parker House website}}</ref>
* [[Kingman Hall]]<ref>See:
* Konglig Datasektionen KTH

* Ka-Ping Yee, [https://zestyping.livejournal.com/102718.html Condorcet elections], March 2005
* Ka-Ping Yee, [https://zestyping.livejournal.com/111588.html Kingman adopts Condorcet voting], April 2005</ref>
* Associated Students of [[Minerva University|Minerva Schools at KGI]]<ref>article 9.4.5.h of the [https://associatedstudents.minerva.community/wp-content/uploads/2017/11/ASM-Charter-November-2017.pdf charter], November 2017</ref>
* Associated Student Government at [[Northwestern University]]<ref>[http://www.northbynorthwestern.com/story/ajith-van-atta-win-asg-election/ Ajith, Van Atta win ASG election], April 2013</ref>
* Associated Student Government at [[University of Freiburg]]<ref>§6 and §7 of its [http://www.u-asta.uni-freiburg.de/vs/stura/stura-go-entgultig-beschlossene-form-13.05.2014.pdf bylaws], May 2014</ref>
* Associated Student Government at the Computer Sciences Department of the [[University of Kaiserslautern]]<ref>§6(6) of the [https://www.fachschaft.informatik.uni-kl.de/wp-content/uploads/2020/06/go.pdf bylaws]</ref>

=== Organizations ===
It is used by the [[Institute of Electrical and Electronics Engineers]], by the [[Association for Computing Machinery]], and by [[USENIX]]{{Cn|date=October 2024}} through their use of the HotCRP decision tool.{{Technical inline|date=October 2024}}

Organizations which currently use the Schulze method include:
{{div col|colwidth=30em}}
* [[Annodex|Annodex Association]]<ref>[https://civs.cs.cornell.edu/cgi-bin/results.pl?id=E_50cfc592ae8f13d9 Election of the Annodex Association committee for 2007], February 2007</ref>
* {{ill|Berufsverband der Kinder- und Jugendärzte|de}} (BVKJ)<ref>§9a of the [https://www.bvkj.de/mitgliedschaft/satzung bylaws], October 2013</ref>
* [[BoardGameGeek]]<ref>See:
* 2013 Golden Geek Awards - Nominations Open, January 2014
* 2014 Golden Geek Awards - Nominations Open, January 2015
* 2015 Golden Geek Awards - Nominations Open, March 2016
* 2016 Golden Geek Awards - Nominations Open, January 2017
* 2017 Golden Geek Awards - Nominations Open, February 2018
* 2018 Golden Geek Awards - Nominations Open, March 2019</ref>
* [[Cloud Foundry|Cloud Foundry Foundation]]<ref>article 7(e)(iii)(2) of the [https://www.cloudfoundry.org/wp-content/uploads/cff-charter-changes-with-TOC.-2021.pdf charter], May 2021</ref>
* County Highpointers<ref>Adam Helman, [http://www.cohp.org/records/votes/family_affair_voting_scheme.html Family Affair Voting Scheme - Schulze Method]</ref>
* [[Dapr]]<ref>[https://github.com/dapr/community/blob/master/steering-and-technical-committee-charter.md Steering and Technical committee], November 2021</ref>
* [[Debian]]<ref name="Debian">See:

* [https://www.debian.org/vote/2003/vote_0002 Constitutional Amendment: Condorcet/Clone Proof SSD Voting Method], June 2003
* [https://www.debian.org/devel/constitution Constitution for the Debian Project], appendix A6
* [https://www.debian.org/vote/ Debian Voting Information]</ref>
* [[EuroBillTracker]]
* [[European Democratic Education Community]] (EUDEC)<ref>{{cite web|url=https://eudec.org/about-us/guidance-document/|title=Guidance Document |publisher=Eudec.org |date=2009-11-15 |access-date=2010-05-08}}</ref>
* [[FFmpeg]]<ref>[http://article.gmane.org/gmane.comp.video.ffmpeg.devel/113026/match=%22schulze%20method%22+%22Cloneproof%20schwartz%20sequential%20droping%22+Condorcet Democratic election of the server admins] {{Webarchive|url=https://web.archive.org/web/20151002053259/http://article.gmane.org/gmane.comp.video.ffmpeg.devel/113026/match=%22schulze%20method%22+%22Cloneproof%20schwartz%20sequential%20droping%22+Condorcet |date=2015-10-02 }}, July 2010</ref>
* [[Free Geek]]<ref>[http://wiki.freegeek.org/images/7/7a/Voters_guide.pdf Voters Guide], September 2011</ref>
*  Free Hardware Foundation of Italy
* [[Gentoo Linux|Gentoo Foundation]]<ref name="Gentoo">[[gentoo:Project:Elections#Condorcet_method_of_voting|Project:Elections]]</ref>
* [[GNU Privacy Guard]] (GnuPG)<ref>{{Cite web |date=2013-10-03 |title=CIVS Election Results: GnuPG Logo Vote |url=http://logo-contest.gnupg.org/results.html |archive-url=https://web.archive.org/web/20131003164018/http://logo-contest.gnupg.org/results.html |archive-date=2013-10-03  |access-date=2022-09-24 }}</ref>
* [[Haskell (programming language)|Haskell]]<ref>[https://civs.cs.cornell.edu/cgi-bin/results.pl?num_winners=1&id=E_d21b0256a4fd5ed7&algorithm=beatpath Haskell Logo Competition], March 2009</ref>
* [[Homebrew (package manager)|Homebrew]]<ref>[https://github.com/Homebrew/brew/blob/30c80dec155df6cc8603e2b70966943723911d27/docs/Homebrew-Governance.md#6-project-leader Article 6 Section 2 of the Constitution], February 2021</ref>
* [[ICANN|Internet Corporation for Assigned Names and Numbers]] (ICANN) (until 2023)<ref>section 9.4.7.3 of the [https://web.archive.org/web/20230606191239/https://aso.icann.org/documents/operational-documents/operating-procedures-of-the-address-council-of-the-address-supporting-organization/ Operating Procedures of the Address Council of the Address Supporting Organization] (archived from [https://aso.icann.org/documents/operational-documents/operating-procedures-of-the-address-council-of-the-address-supporting-organization/#A_7.2.3._Ranked_Choice_Instant_Runoff source] 2023-06-06)</ref>
*  Kanawha Valley Scrabble Club<ref>{{Cite web |date=2009-04-02 |title=A club by any other name... |url=http://wvscrabble.blogspot.com/2009/04/club-by-any-other-name.html |access-date=2022-09-24 |website=Kanawha Valley Scrabble Club}}</ref>
* [[KDE|KDE e.V.]]<ref name="KDE">section 3.4.1 of the [https://ev.kde.org/rules/online_voting.php Rules of Procedures for Online Voting]</ref>
* [[John S. and James L. Knight Foundation|Knight Foundation]]<ref>[https://civic.mit.edu/2009/6/23/knight-foundation-awards-5000-to-best-created-on-the-spot-projects/ Knight Foundation awards $5000 to best created-on-the-spot projects], June 2009</ref>
* [[Kubernetes]]<ref>{{Citation |title=Kubernetes Community |date=2022-09-24 |url=https://github.com/kubernetes/community/blob/dd18326394391b67662e9e062d8f3321a776f4dd/committee-code-of-conduct/election.md |publisher=Kubernetes |access-date=2022-09-24}}</ref>
* [[Kumoricon]]<ref>{{Cite web |title=Kumoricon – Mascot Contest |url=https://www.kumoricon.org/ |access-date=2022-09-24 |website=Kumoricon}}</ref>
* [[League of Professional System Administrators]] (LOPSA)<ref>article 8.3 of the [http://governance.lopsa.org/LOPSA_Bylaws bylaws]</ref>
* [[LiquidFeedback]]<ref name="PrinciplesOfLiquidFeedback">{{Cite book
| title = The Principles of LiquidFeedback
| publisher = Interaktive Demokratie e. V.
| isbn = 978-3-00-044795-2
| url = http://principles.liquidfeedback.org/
| location = Berlin
| year = 2014
}}</ref> 
* Madisonium<ref>{{cite web|url=https://docs.google.com/document/d/1UhAGouwOEbzM6Uv3fQd78e5P1VfuYldtjjEK7XO_B3Y/edit|title=Madisonium Bylaws - Adopted|work=Google Docs}}</ref>
* [[Metalab]]<ref>{{cite web|url=https://metalab.at/wiki/Generalversammlung_2007/Wahlmodus |title=Wahlmodus |language=de |publisher=Metalab.at |access-date=2010-05-08}}</ref>
* [[MTV]]<ref>David Chandler, [https://news.mit.edu/newsoffice/2008/techtalk52-19.pdf Voting for more than just either-or], MIT Tech Talk, volume 52, number 19, page 2, 12 March 2008</ref>
* [[Neo (keyboard layout)|Neo]]<ref>See:
* [http://wiki.neo-layout.org/wiki/Neo-2-Freeze/Wahl?version=10#a7.Wahlverfahren Wahlen zum Neo-2-Freeze: Formalitäten] {{Webarchive|url=https://web.archive.org/web/20110727115047/http://wiki.neo-layout.org/wiki/Neo-2-Freeze/Wahl?version=10#a7.Wahlverfahren |date=2011-07-27 }}, February 2010
* Hinweise zur Stimmabgabe, March 2010
* Ergebnisse, March 2010</ref>
* [[Noisebridge]]<ref>{{cite web|url=https://www.noisebridge.net/index.php?title=2009_Director_Elections&oldid=8951|title=2009 Director Elections|work=noisebridge.net}}</ref>
* [[OpenEmbedded]]<ref>{{cite web|url=http://www.openembedded.org/wiki/Online_Voting_Policy|title=Online Voting Policy|work=openembedded.org}}</ref>
* [[Open Neural Network Exchange]]<ref>[https://github.com/onnx/onnx/blob/master/community/sc-election-guidelines.md ONNX Steering Committee election guideline]</ref>
* [[OpenStack]]<ref>{{Cite web |title=OpenStack Election — OpenStack Governance |url=https://governance.openstack.org/election/#election-system |access-date=2022-09-24 |website=governance.openstack.org}}</ref>
* OpenSwitch<ref>{{Cite web |last=Mark |first=Atwood |date=May 25, 2016 |title=[Partners] text of OpenSwitch Project Charter 2016-05-03 |url=https://lists.linuxfoundation.org/pipermail/ops-partners/2016-May/000030.html |access-date=2022-09-24}}</ref>
* [[RLLMUK]]<ref>{{Cite web |title=Committee Elections 2012 |url=https://www.rllmukforum.com/index.php?/topic/260622-committee-elections-2012/ |access-date=2022-09-24 |website=rllmuk |date=10 April 2012 |language=en-GB}}</ref>
* [[Squeak]]<ref>[https://civs.cs.cornell.edu/cgi-bin/results.pl?num_winners=7&id=E_716d8c257e6cf36b&algorithm=beatpath Squeak Oversight Board Election 2010], March 2010</ref>
* [[Students for Free Culture]]<ref>See:
* [http://wiki.freeculture.org/Bylaws Bylaws of the Students for Free Culture] {{Webarchive|url=https://web.archive.org/web/20130318164643/http://wiki.freeculture.org/Bylaws |date=2013-03-18 }}, article V, section 1.1.1
* [https://blog.selectricity.org/2008/02/15/free-culture-student-board-elected-using-selectricity/ Free Culture Student Board Elected Using Selectricity], February 2008</ref>
* [[Sugar Labs]]<ref>{{Cite web |title=[IAEP] Election status update |url=http://lists.sugarlabs.org/archive/iaep/2009-September/008620.html |access-date=2022-09-24 |website=lists.sugarlabs.org}}</ref>
* [[Sverok]]<ref>[https://medlem.sverok.se/2019/01/18/vad-hande-pa-riksmotet-2018/ Minutes of the 2018 Annual Sverok Meeting], November 2018</ref>
* [[TopCoder]]<ref name="TopCoder">
{{Cite web |title=2007 TopCoder Collegiate Challenge |url=https://community.topcoder.com/tc?module=Static&d1=tournaments&d2=tccc07&d3=blog&d4=description |access-date=2022-09-24 |website=community.topcoder.com}}</ref>
* [[Ubuntu (operating system)|Ubuntu]]<ref>{{Cite web |last=Bell |first=Alan |date=May 17, 2012 |title=Ubuntu IRC Council Position |url=https://lists.ubuntu.com/archives/ubuntu-irc/2012-May/001538.html |access-date=2022-09-24}}</ref>
* [[Vidya Gaem Awards]]<ref>{{cite web|url=https://2012.vidyagaemawards.com/voting/results/pairwise|title=/v/GAs - Pairwise voting results|work=vidyagaemawards.com}}</ref>
* [[Wikimedia Foundation|Wikimedia]] (2008)<ref name="Wikimedia">See:

* [[metawiki:Board elections/2008/Results/en|2008 Board Elections]], June 2008
* [[metawiki:Board elections/2009/Results/en|2009 Board Elections]], August 2009
* [[metawiki:Board elections/2011/Results/en|2011 Board Elections]], June 2011</ref>
* [[Wikipedia]] in [[French Wikipedia|French]],<ref name="FrenchWikipedia">{{Citation |title=Wikipédia:Prise de décision/Choix dans les votes |date=2019-08-22 |url=https://fr.wikipedia.org/w/index.php?title=Wikip%C3%A9dia:Prise_de_d%C3%A9cision/Choix_dans_les_votes&oldid=162034454 |work=Wikipédia |language=fr |access-date=2022-09-24}}</ref> [[Hebrew Wikipedia|Hebrew]],<ref>{{cite web|url=https://he.wikipedia.org/wiki/ויקיפדיה:פרלמנט/הכרעה|title=ויקיפדיה:פרלמנט/הכרעה|trans-title=Wikipedia:Parliament/Decisionmaking|website=he.wikipedia.org|language=he}}</ref>{{Circular reference|date=August 2024}}<ref>See e.g. here [https://he.wikipedia.org/w/index.php?title=ויקיפדיה:פרלמנט&oldid=7014412] (May 2009), here [https://he.wikipedia.org/w/index.php?title=ויקיפדיה:סדנה_לגרפיקה/סמליל&oldid=7388447] (August 2009), and here [https://he.wikipedia.org/w/index.php?title=ויקיפדיה:סדנה_לגרפיקה/100,000/הצבעה&oldid=8057743] (December 2009).</ref> [[Hungarian Wikipedia|Hungarian]],<ref>See [[:hu:Wikipédia:Szavazás/Az „Arbitrációs Bizottság” magyar neve|here]] and [[:hu:Sablonvita:Bővebben/Szavazás#A szavazás módja|here]].</ref> [[Russian Wikipedia|Russian]],<ref>{{cite web|url=http://y.kalan.cc/schulze|trans-title=Result of Arbitration Committee Elections|script-title=ru:Девятнадцатые выборы арбитров, второй тур|work=kalan.cc|url-status=dead|archive-url=https://web.archive.org/web/20150222225428/http://y.kalan.cc/schulze|archive-date=2015-02-22|lang=ru}}</ref> and [[Persian Wikipedia|Persian]].<ref>See [//fa.wikipedia.org/w/index.php?oldid=18462330 here]</ref>
{{div col end}}

== Notes ==
<references ></references>

== External links ==
{{Commons}}

* [[arxiv:1804.02973|The Schulze Method of Voting]] by Markus Schulze
* [https://www.youtube.com/watch?v=_HVeN0GnnuA The Schulze Method] by [[Hubert Bray]]
* [http://www.informatik.uni-freiburg.de/~ki/teaching/ss09/gametheory/spieltheorie.pdf Spieltheorie] {{in lang|de}} by [[Bernhard Nebel]]
* [http://accuratedemocracy.com/voting_rules.htm Accurate Democracy] by Rob Loring
* Christoph Börgers (2009), ''[https://books.google.com/books?id=dccBaphP1G4C&pg=PA37 Mathematics of Social Choice: Voting, Compensation, and Division]'', SIAM, {{ISBN|0-89871-695-0}}
* [[Nicolaus Tideman]] (2006), ''[https://books.google.com/books?id=RN5q_LuByUoC&pg=PA228 Collective Decisions and Voting: The Potential for Public Choice]'', Burlington: Ashgate, {{ISBN|0-7546-4717-X}}
* [http://www.public-software-group.org/preftools preftools] by the Public Software Group
* [http://apps.azsos.gov/election/2008/general/ballotmeasuretext/I-21-2008.pdf Arizonans for Condorcet Ranked Voting]
* [https://github.com/julien-boudry/Condorcet Condorcet PHP] Command line application and [[PHP]] [[Library (computing)|library]], supporting multiple Condorcet methods, including Schulze.
* [https://github.com/zephyr/schulze-voting Implementation in Java]
* [https://github.com/coorasse/schulze-vote Implementation in Ruby]
* [https://github.com/bradbeattie/python-vote-core Implementation in Python 2]
* [https://github.com/woctezuma/schulze-method Implementation in Python 3]
{{voting systems}}