Nanson's method

Part of the Politics series
Electoral methods
Single-winner
Simple majoritarianism Plurality First-past-the-post voting Multiple-round systems Two round Exhaustive ballot Preferential systems Condorcet methods Copeland's method Kemeny–Young method Minimax Nanson's method Ranked pairs Schulze method Bucklin voting Oklahoma primary electoral system Coombs' method Instant-runoff (alternative vote) Contingent vote Borda count Rated systems Range voting Approval voting Majority Judgment
Multiple-winner
Proportional representation Party-list  (open · closed · mixed · local) Highest averages D'Hondt method Sainte-Laguë method Largest remainder Hare quota Droop quota Imperiali quota Single transferable vote CPO-STV Schulze STV Wright system Semi-proportional representation Cumulative voting Limited voting Single non-transferable vote Additional member system Parallel voting Majoritarian representation Plurality-at-large Preferential block voting General ticket
Proxy voting
Delegable proxy Delegated proxy
Random selection
Demarchy Sortition Random ballot
Social choice theory
Arrow's theorem Gibbard–Satterthwaite theorem Voting system criteria
Politics portal
v · d · e

The Borda count can be combined with an Instant Runoff procedure to create hybrid election methods that are called Nanson method and Baldwin method.

Nanson method

The Nanson method is based on the original work of the mathematician Edward J. Nanson.

Nanson's method eliminates those choices from a Borda count tally that are at or below the average Borda count score, then the ballots are retallied as if the remaining candidates were exclusively on the ballot. This process is repeated if necessary until a single winner remains.

Baldwin method

This variant was devised by Joseph M. Baldwin and works like this:

Candidates are voted for on ranked ballots as in the Borda count. Then, the points are tallied in a series of rounds. In each round, the candidate with the fewest points is eliminated, and the points are re-tallied as if that candidate were not on the ballot.

Satisfied and failed criteria

The Nanson method and the Baldwin method satisfy the Condorcet criterion: since Borda always gives any existing Condorcet winner more than the average Borda points, the Condorcet winner will never be eliminated. They do not satisfy the independence of irrelevant alternatives criterion, the monotonicity criterion, the participation criterion, the consistency criterion and the independence of clones criterion, while they do satisfy the majority criterion, the mutual majority criterion, the Condorcet loser criterion, and the Smith criterion. The Nanson method satisfies reversal symmetry, while the Baldwin method violates reversal symmetry.

Use of Nanson and Baldwin

Nanson's method was used in city elections in the U.S. town of Marquette, Michigan in the 1920s.^[1] It was formally used by the Anglican Diocese of Melbourne and in the election of members of the University Council of the University of Adelaide. It was used by the University of Melbourne until 1983.

Note

1. ^ See: Australian electoral reform and two concepts of representation

Advocacy

• A case for Baldwin's Method by Ian Fellows