NAME
Vote::Count::TieBreaker
VERSION 0.021
Tie Breakers
The most important thing for a Tie Breaker to do is it should use some reproducable difference in the Ballots to pick a winner from a Tie. The next thing it should do is make sense. Finally, the ideal Tie Breaker will resolve when there is any difference to be found. Arguably the best use of Borda Count is as a Tie Breaker, First Choice votes and Approval are also other great choices.
Grand Junction
The Grand Junction (also known as Bucklin) method is one of the simplest and easiest to Hand Count RCV resolution methods. Other than that it is generally not considered a good method.
Because it is simple, and always resolves, except when ballots are perfectly matched up, it is a really
The (Standard) Grand Junction Method
Count the Ballots to determine the quota for a majority.
Count the first choices and elect a choice which has a majority.
If there is no winner add the second choices to the totals and elect the choice which has a majority (or the most votes if more than one choice reaches a majority).
Keep adding the next rank to the totals until either there is a winner or all ballots are exhausted.
When all ballots are exhausted the choice with the highest total wins.
As a Tie Breaker
The Tie Breaker Method is modified.
Instead of Majority, any choice with a current total less than another is eliminated.
The winner is the last choice remaining.
head2 TieBreakerGrandJunction
my $resolve = $Election->TieBreakerGrandJunction( $choice1, $choice2 );
if ( $resolve->{'winner'}) { say "Tie Winner is $resolve->{'winner'}"}
elsif ( $resolve->{'tie'}) {
my @tied = $resolve->{'tied'}->@*;
say "Still tied between @tied."
}
The Tie Breaking will be logged to the verbose log, any number of tied choices may be provided.
BUG TRACKER
https://github.com/brainbuz/Vote-Count/issues
AUTHOR
John Karr (BRAINBUZ) brainbuz@cpan.org
CONTRIBUTORS
Copyright 2019 by John Karr (BRAINBUZ) brainbuz@cpan.org.
LICENSE
This module is released under the GNU Public License Version 3. See license file for details. For more information on this license visit http://fsf.org.