Summed-Ranks

From Electowiki
Jump to navigation Jump to search

Summed-Ranks (abbreviated SR) is a ranked voting method.

Rankings may be of any length, ranking as many or as few candidates as desired. Several candidates can be ranked at the same position.

The winner is the candidate with the fewest candidates ranked over him/her, as summed over all of the ballots.

(For instance, if there are 3 ballots, and one of them ranks 2 candidates over X, and one ranks 3 candidates over X, and one ranks 5 candidates over X, then, overall, X has 10 candidates ranked over him, as summed over all the ballots).

A ballot "bottom-ranks" a candidate if it ranks someone over him/her, and it doesn't rank him/her over anyone.

Each candidate bottom-ranked on a ballot is counted as having all candidates, including all of that ballot's other bottom-ranked candidates, ranked over him/her on that ballot.

Analysis[edit | edit source]

SR meets criteria not met by other Borda versions. These are listed below, with comments:

The favorite betrayal criterion[edit | edit source]

SR passes the favorite betrayal criterion. Because of of SR's FBC compliance, SR gives no incentive or need for compromise strategy beyond compromising-compression. There's never a reason to not rank one's favorite in 1st place, along with whatever compromise(s) one wishes to also rank there.

Later-No-Help[edit | edit source]

SR passes Later-no-help. Because of SR's LNHelp compliance, SR never gives incentive or need to rank unacceptable candidates. If the most important goal is to keep the winner from coming from a certain set, then, for that goal, it is never necessary to rank any member of that set.

Others[edit | edit source]

SR's other criterion-compliances are similar to those of other Borda versions. For example, SR passes Participation and Consistency, and fails Independence of Irrelevant Alternatives and Clone Independence.

In addition to Participation, SR passes Participation's more-easily-passed variations:

Mono-Add-Top[edit | edit source]

Adding, to the election, a ballot that votes X at top shouldn't cause X to lose.

Mono-Add-Unique-Top[edit | edit source]

Adding a ballot that votes X over everyone else shouldn't cause X to lose.

Comments[edit | edit source]

SR greatly alleviates the typical Borda clone problem. In ordinary Borda, it's advantageous for a faction or party to nominate many identical candidates. Even when the alternatives-set is fixed, sets of very similar alternatives are favored.

But SR's treatment of bottom-ranked candidates penalizes that large number of identical candidates, on ballots that bottom-rank them.

SR is Approval, for voters who only use the two rank levels of top and unranked.

SR can be justified only if its count is a lot easier than that of the best Condorcet methods. Such is the case.

SR's count labor is proportional only to the first power of the number of candidates. It's only necessary to make one pass through each ballot.

SR's method-chosen ratings for each rank position can be regarded as approximations to the ratings that voters would assign in Score—but voters are relieved of the task of rating. In that way, SR approximates Score's social-utility maximization under sincere voting, and Score's fractional ratings due to uncertainty or for defection-deterrence in a divided majority.

SR is for when it's desired to give voters the simple instruction to mark 1st choice(s), 2nd choice(s), etc., instead of asking them to rate the candidates or alternatives, and the number of alternatives is prohibitively large for a Condorcet hand count, and a Condorcet-programmed computer isn't available to do the count.