Please rewatch the video from about 4:40. Your comment doesn’t address the “White Tiger”, 65% issue.
Ideally, white tiger, purple tiger, and green gorrilla would be elected, as this is the outcome most proportional to voter intent.
But under the logic you describe, purple tiger, with the least votes, would be eliminated after the first round. 2/3 of the populace have indicated they want tigers, but we’re about to empanel one tiger and two gorillas.
In actuality, we are not removing the least popular candidate in each round. We are only removing the least popular option if the most popular option does not exceed the mathematical threshold for locking a seat. If they do exceed that threshold, we are removing the top candidate - not the bottom - before we count the next round. The top candidate gets the first seat, and the remaining candidates are competing for the second and third seats.
I was describing single winner, you’re describing multiple winner
Those are implemented very differently.
You can guarantee that popular choices gets represented (assuming enough seats for all popular choices) if you do pre-filtering rounds where you give weighted scoring to candidates based on their accumulated ballot rank positions. This would quickly sort out many last rank choices and few-first choices. Then you can proceed with the rounds of eliminations.
Practically speaking, perfect fairness is mathematically proven impossible. You have to make tradeoffs and pick a system that will likely get a good enough result
Please rewatch the video from about 4:40. Your comment doesn’t address the “White Tiger”, 65% issue.
Ideally, white tiger, purple tiger, and green gorrilla would be elected, as this is the outcome most proportional to voter intent.
But under the logic you describe, purple tiger, with the least votes, would be eliminated after the first round. 2/3 of the populace have indicated they want tigers, but we’re about to empanel one tiger and two gorillas.
In actuality, we are not removing the least popular candidate in each round. We are only removing the least popular option if the most popular option does not exceed the mathematical threshold for locking a seat. If they do exceed that threshold, we are removing the top candidate - not the bottom - before we count the next round. The top candidate gets the first seat, and the remaining candidates are competing for the second and third seats.
I was describing single winner, you’re describing multiple winner
Those are implemented very differently.
You can guarantee that popular choices gets represented (assuming enough seats for all popular choices) if you do pre-filtering rounds where you give weighted scoring to candidates based on their accumulated ballot rank positions. This would quickly sort out many last rank choices and few-first choices. Then you can proceed with the rounds of eliminations.
Practically speaking, perfect fairness is mathematically proven impossible. You have to make tradeoffs and pick a system that will likely get a good enough result
https://en.wikipedia.org/wiki/Arrow's_impossibility_theorem
https://www.sciencedaily.com/releases/2026/08/260801042812.htm