Resolvability criterion

The resolvability criterion is one of two criteria that ensure that the voting method does not have a large number of ties.

• 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.

This page is a stub - please add to it.