Ranked-ballot voting calculator

This form calculates the winners of several ranked-ballot voting methods.  See below for input examples.

Each line must consist of candidate names separated by > or =.  Each candidate name must be one word and consist only of uppercase and lowercase letters (case is significant, so LeGrand is not the same as Legrand).  One ballot per line is assumed unless the line begins with a number followed by a colon; the number specifies how many ballots share that ranking.  If a candidate appears more than once on a line, only the first (highest) occurrence is counted.  A # begins a comment that extends to the end of the line; the calculator ignores comments.  Ballots themselves can be commented out by inserting a # at the beginning of the line.

If a list of candidates to ignore is given, those candidates will be treated as if they dropped out of the election between the collection and counting of the ballots.

If a tiebreaking ranking is given, it must include all of the candidates.  If none is given and a tiebreaking ranking is needed, it will be generated by drawing a random ballot and breaking its tied preferences randomly.

Checking the “Reverse all rankings” box effectively flips the preferences in each ballot and in the tiebreaker; it’s useful to test for reverse-symmetry violations.

Here are some example ranked-ballot inputs to use.  Just copy one of these text blocks and paste it into the input field above.  See if you can guess the results!

This ranked-ballot voting calculator was inspired in part by Rob Lanphier’s Pairwise Methods Demonstration; Lanphier maintains the Election Methods mailing list.  In turn, my calculator inspired Eric Gorr’s Condorcet Matrix.

Please e-mail any questions, problems or suggestions to rob@approvalvoting.org.

Back to Ranked-ballot voting methods