Reversal symmetry

The reversal criterion is a voting system criterion which says that if every voter's opinions on each of the candidates is perfectly reversed (i.e. they rank candidates in order from worst to best), the outcome of the election should be reversed as well, i.e. the first- and last- place finishers should switch places.[1] In other words, the results of the election should not depend arbitrarily on whether voters rank candidates from best to worst (and then select the best candidate), or whether we ask them to rank candidates from worst to best (and then select the least-bad candidate).

Another, equivalent way to motivate the criterion is to say that a voting system should never elect the worst candidate, according to the method itself (as doing so suggests the method is, in some sense, self-contradictory). The worst candidate can be identified by reversing all ballots (to rank candidates from worst-to-best) and then running the algorithm to find a single worst candidate.[2]

Situations where the same candidate is elected when all ballots are reversed are sometimes called best-is-worst paradoxes, and can occur in ranked-choice runoff voting (RCV) and minimax. Methods that satisfy reversal symmetry include the Borda count, ranked pairs, Kemeny–Young, and Schulze. Most rated voting systems, including approval and score voting, satisfy the criterion as well.

  1. ^ Saari, Donald G. (2012-12-06). Geometry of Voting. Springer Science & Business Media. ISBN 978-3-642-48644-9.
  2. ^ Schulze, Markus (2024-03-03), The Schulze Method of Voting, doi:10.48550/arXiv.1804.02973, retrieved 2024-07-27

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search