News for hackers. Stuff that matters.
Re:Ranked-choice voting is on the ballot in New York City by thaumasiotes on Wednesday October 23, 2019 @03:52PM (#21338212)
Let's consider an example:

You have 100 candidates. For 99 of those candidates, the entire electorate agrees that any one of these interchangeable guys would do a fine job. Nobody prefers any of them to any other.

The last candidate is Mao Zedong. Under his leadership, the country's industrial and agricultural bases will be systematically destroyed, anyone who owns a rental property will be executed, and tens of millions of people will starve to death for no reason.

The electorate agrees that Mao is an undesirable choice.

So: any method that can't pick Mao achieves a VSE of 100%.

Sortition, by definition, achieves a VSE of 0%. But it's still pretty good -- there's a 99% chance of selecting one of the good guys, and a 1% chance of epic, country-shattering disaster.

A method that is guaranteed to select Mao has a VSE of, I assume, -100%. But it is much, much worse than sortition (the notional midpoint, 0%), while the VSE of 100% is only moderately better than sortition.

These numbers don't make sense.

There are no comments on this comment yet.