Jump to navigation Jump to search
This article does not cite any sources. (November 2014) (Learn how and when to remove this template message)
Resolvability criterion can refer to any voting system criterion that ensures a low possibility of tie votes.
- In Nicolaus Tideman's version of the criterion, for every (possibly tied) winner in a result, there must exist a way for one added vote to make that winner unique.
- Douglas R. Woodall's version requires that the proportion of profiles giving a tie approaches zero as the number of voters increases toward infinity.
- "Proof MAM is resolvable and reasonably deterministic". alumnus.caltech.edu. Retrieved 2018-07-21.
- Schulze, Markus (3 March 2017). "A New Monotonic, Clone-Independent, Reversal Symmetric, and Condorcet-Consistent Single-Winner Election Method" (PDF).