Hacker News new | ask | show | jobs
by desdiv 4204 days ago
That's actually exactly what I had in mind. Range voting[0], for example, doesn't suffer from Arrow's impossibility theorem, Gibbard–Satterthwaite theorem, nor the Condorcet's paradox.

[0]http://en.wikipedia.org/wiki/Range_voting

1 comments

You know, I had a long comment here pointing out many problems with range voting. Instead, I'd like to observe that it really takes balls to defend range voting as "not suffering from the Gibbard-Satterthwaite theorem" when it's easy to show that range voting exhibits one of the failures that the Gibbard-Satterthwaite theorem guarantees in pure-ranking voting systems. Sure, the premises don't hold, but so what? If Gibbard-Satterthwaite did apply to range voting, that would guarantee no other problems than already occur.

Theorem: Hitting your thumb with a steel hammer, instead of hitting the nail, hurts like crazy!

Problem: The pain of a smashed thumb is bad.

Solution: Use an iron hammer. The requirements of the earlier theorem don't apply.