Nanson's method

Both methods are designed to satisfy the Condorcet criterion, and allow for incomplete ballots and equal rankings.

[1]: 240 Schwartz in 1986 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.

[1]: 217 It was systematized by Joseph M. Baldwin[3] in 1926, who incorporated a more efficient matrix tabulation[4] and extended it to support incomplete ballots and equal rankings, by counting fractional points in such cases.

[2] This system has been proposed for use in the United States under the name "Total Vote Runoff", by Edward B. Foley and Eric Maskin, as a way to fix problems with the instant-runoff method in U.S. jurisdictions that use it.

[10] Both the Nanson and the Baldwin methods can be run in polynomial time to obtain a single winner.

A ranked ballot with incomplete preferences, as illustrated by Nanson. [ 1 ] : 37