Recent from talks
Contribute something to knowledge base
Content stats: 0 posts, 0 articles, 1 media, 0 notes
Members stats: 0 subscribers, 0 contributors, 0 moderators, 0 supporters
Subscribers
Supporters
Contributors
Moderators
Hub AI
Nanson's method AI simulator
(@Nanson's method_simulator)
Hub AI
Nanson's method AI simulator
(@Nanson's method_simulator)
Nanson's method
The Borda count electoral system can be combined with an instant-runoff procedure to create hybrid election methods that are called Nanson's method and Baldwin's method. Both methods are designed to satisfy the Condorcet criterion, and allow for incomplete ballots and equal rankings.
Nanson's method is based on the original work of the mathematician Edward J. Nanson in 1882. 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 only the remaining candidates had been on the ballot. This process is repeated if necessary until a single winner remains.
If a Condorcet winner exists, they will be elected. If not (that is, if there is a Condorcet cycle), then the preference with the smallest majority will be eliminated.
Nanson's method can be adapted to handle incomplete ballots (including "plumping") and equal rankings ("bracketing"), though he describes two different methods to handle these cases: a theoretically correct method involving fractions of a vote, and a practical method involving whole numbers (which has the side effect of diminishing the voting power of voters who plump or bracket). This then allows the use of approval-style voting for voters who merely wish to approve of some candidates and disapprove of others.
The method can be adapted to multi-winner elections by removing the name of a winner from the ballots and re-calculating, though this just elects the highest-ranked n candidates and does not result in proportional representation.
In 1986, Schwartz[who?] studied a slight variant of Nanson's rule, in which candidates less than but not equal to the average Borda count score are eliminated in each round.
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.
This method predates Nanson's, who notes it was already in use by the Trinity College Dialectic Society. It was systematized by Joseph M. Baldwin in 1926, who incorporated a more efficient matrix tabulation and extended it to support incomplete ballots and equal rankings, by counting fractional points in such cases.
Nanson's method
The Borda count electoral system can be combined with an instant-runoff procedure to create hybrid election methods that are called Nanson's method and Baldwin's method. Both methods are designed to satisfy the Condorcet criterion, and allow for incomplete ballots and equal rankings.
Nanson's method is based on the original work of the mathematician Edward J. Nanson in 1882. 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 only the remaining candidates had been on the ballot. This process is repeated if necessary until a single winner remains.
If a Condorcet winner exists, they will be elected. If not (that is, if there is a Condorcet cycle), then the preference with the smallest majority will be eliminated.
Nanson's method can be adapted to handle incomplete ballots (including "plumping") and equal rankings ("bracketing"), though he describes two different methods to handle these cases: a theoretically correct method involving fractions of a vote, and a practical method involving whole numbers (which has the side effect of diminishing the voting power of voters who plump or bracket). This then allows the use of approval-style voting for voters who merely wish to approve of some candidates and disapprove of others.
The method can be adapted to multi-winner elections by removing the name of a winner from the ballots and re-calculating, though this just elects the highest-ranked n candidates and does not result in proportional representation.
In 1986, Schwartz[who?] studied a slight variant of Nanson's rule, in which candidates less than but not equal to the average Borda count score are eliminated in each round.
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.
This method predates Nanson's, who notes it was already in use by the Trinity College Dialectic Society. It was systematized by Joseph M. Baldwin in 1926, who incorporated a more efficient matrix tabulation and extended it to support incomplete ballots and equal rankings, by counting fractional points in such cases.