I know this isn’t really the place for an IRV discussion, but I had an idea which we might be able to pitch to FairVote:
We do IRV all the way until the step where it picks a winner, but then the system does a check; of all the eliminated candidates, if you brought them in one at a time, can any of them get more votes than the current winner (based on redistributing votes, so if I rank an eliminated candidate 2nd and the majority winner 3rd, the check would give my vote back to the eliminated candidate.) If there are multiple eliminated candidates who beat the current winner, who by the most? I think it’s essentially like a Condorcet, pairwise method, but it’s done as a modification to IRV, so it should work well for FairVote’s purposes.
An example: 100 voters, 3 candidates - a Liberal, Moderate, and Conservative. Assume people vote honestly, for all candidates, and their preferences are “rational.”
- 40 people rank Liberal 1st
- 19 Moderate
- 41 Conservative
Let’s say 10 moderates prefer Conservative, 9 prefer Liberal.
Proceeding by IRV rules, Moderate is eliminated first, and now it’s Liberal 49, Conservative 51. Conservative wins.
But with this modification, the check would bring Moderate back. Moderate is preferred by 59 people over Conservative’s 41, and wins instead.
As far as I can tell, this is less vulnerable to strategy due to the elimination and checks, but idk.
^(a tangentially related modification: let 1st preference candidates specify the order of the remaining candidates, so that bullet voters still count)
^(the thinking behind this system is similar to Asset: find a way to get a more “solid” majority every time someone’s about to win)