Resolvability criterion
Encyclopedia
Resolvability criterion can refer to any voting system criterion that ensures a low possibility of tie votes.
Both versions are satisfied e.g. by approval voting
, range voting
, Borda count
, instant-runoff voting
, Minimax
, plurality
, Ranked Pairs
http://alumnus.caltech.edu/~seppley/Proof%20MAM%20is%20resolvable%20and%20reasonably%20deterministic.htm, and Schulze
http://home.versanet.de/~chris1-schulze/schulze1.pdf.
Both versions are violated e.g. by Copeland's method
.
- Nicolaus TidemanNicolaus TidemanT. Nicolaus Tideman is a Professor of Economics at Virginia Polytechnic Institute and State University. He received his Bachelor of Arts in economics and mathematics from Reed College in 1965 and his PhD in economics from the University of Chicago in 1969...
's version of the criterion demands that if and only if for every (possibly tied) winner in a result, a vote exists, such that when added, makes that winner unique. - Douglas R. Woodall's version requires that the proportion of profiles giving a tie approaches zero as the number of voters increase towards infinity.
Both versions are satisfied e.g. by approval voting
Approval voting
Approval voting is a single-winner voting system used for elections. Each voter may vote for as many of the candidates as the voter wishes. The winner is the candidate receiving the most votes. Each voter may vote for any combination of candidates and may give each candidate at most one vote.The...
, range voting
Range voting
Range voting is a voting system for one-seat elections under which voters score each candidate, the scores are added up, and the candidate with the highest score wins.A form of range voting was apparently used in...
, Borda count
Borda count
The Borda count is a single-winner election method in which voters rank candidates in order of preference. The Borda count determines the winner of an election by giving each candidate a certain number of points corresponding to the position in which he or she is ranked by each voter. Once all...
, instant-runoff voting
Instant-runoff voting
Instant-runoff voting , also known as preferential voting, the alternative vote and ranked choice voting, is a voting system used to elect one winner. Voters rank candidates in order of preference, and their ballots are counted as one vote for their first choice candidate. If a candidate secures a...
, Minimax
Minimax Condorcet
In voting systems, the Minimax method is one of several Condorcet methods used for tabulating votes and determining a winner when using preferential voting in a single-winner election...
, plurality
Plurality voting system
The plurality voting system is a single-winner voting system often used to elect executive officers or to elect members of a legislative assembly which is based on single-member constituencies...
, Ranked Pairs
Ranked Pairs
Ranked pairs or the Tideman method is a voting system developed in 1987 by Nicolaus Tideman that selects a single winner using votes that express preferences. RP can also be used to create a sorted list of winners....
http://alumnus.caltech.edu/~seppley/Proof%20MAM%20is%20resolvable%20and%20reasonably%20deterministic.htm, and Schulze
Schulze method
The Schulze method is a voting system developed in 1997 by Markus Schulze that selects a single winner using votes that express preferences. The method can also be used to create a sorted list of winners...
http://home.versanet.de/~chris1-schulze/schulze1.pdf.
Both versions are violated e.g. by Copeland's method
Copeland's method
Copeland's method or Copeland's pairwise aggregation method is a Condorcet method in which candidates are ordered by the number of pairwise victories, minus the number of pairwise defeats....
.