I'll share a troubling fact with you if you share one with me
I'll share a troubling fact with you if you share one with me
en.wikipedia.org/…/McKelvey–Schofield_chaos_theor…
There will in most cases be no Condorcet winner and any policy can be enacted through a sequence of votes, regardless of the original policy. This means that adding more policies and changing the order of votes (“agenda manipulation”) can be used to arbitrarily pick the winner.
The article doesn’t explicitly say that this includes policies not preferred by any single voter, but it’s implied by “any” and “arbitrary” (and can be verified by the original theorems).
That’s true for any pairwise vote, but not for the entire sequence.
As in the Condorcet paradox, voter preferences are intransitive: voters preferring A to B and B to C doesn’t imply that voters will prefer A to C. But where the Condorcet paradox shows how this can lead to a cyclical subset of candidates where no candidate can beat all other members of the subset, the chaos theorem shows how this can lead to a series of votes that ends absolutely anywhere.