|
|
|
|
|
by erdevs
2052 days ago
|
|
I see many comments here asserting that RCV is "fundamentally sound" and that there is proof that it satisfies at least strategyproofness (in the sense of Cooperative Game Theory and Social Choice Theory, s.t. revealing/voting for true preferences is at least weakly dominant). But can anyone provide backup for these claims? I'm far from an expert, but I'm curious to reconcile these claims vs Arrow's Theorem and Gibbard's Theorem. My (potentially flawed) understanding as well is that RCV leads to a greater propensity for "extreme" (in the strict sense of being the top choice of a small minority of voters) candidates to win. |
|
Likewise, the biggest flaw of RCV (to me) is that it makes the opposite mistake: it assumes the person with the least votes in each round is the worst. This isn't necessarily the case.
It's still much better than our current system because it collects more data-points from voters about their preferences, and uses that data to make more comparisons between different batches of candidates.
But there are simpler systems out there with even greater voter satisfaction efficiency, because they don't make the same flawed assumptions about voter preferences. In approval voting, you either approve of a candidate or you don't, and you vote as such.
Election science wonks like to talk about theorems and satisfaction of obscure criteria, but I think they often undervalue the two things that matter most: voter satisfaction and simplicity. "Simplicity" meaning: an optimal strategy that's simple-to-explain, an easy to understand outcome, low cost of implementation, etc.
Most of us here are software folks, and we understand that designing a great system is the easy part; the hard parts are implementation and change management. Voting systems should be thought of the same way.