Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

All Arrow's theorem does is say that an ordinal voting method can't simultaneously meet a certain arbitrary collection of criteria.

It doesn't prove that any of those criteria are necessary. Independence of Irrelevant Alternatives, for instance, is especially problematic.

Finally, Condorcet methods don't even fail Arrow's Theorem when there's actually a Condorcet Winner (which is pretty much always given enough voters).



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: