Resolvability criterion

Resolvability criterion can refer to any voting system criterion that ensures a low possibility of tie votes.

1. Nicolaus Tideman's version of the criterion demands that if and only if for every (possibly tied) winner in a result, a vote exists, such that when added, makes that winner unique.
2. Douglas R. Woodall's version requires that the proportion of profiles giving a tie approaches zero as the number of voters increase towards infinity.

Both versions are satisfied e.g. by approval voting, range voting, Borda count, instant-runoff voting, Minimax, plurality, Ranked Pairs [1], and Schulze [2].

Both versions are violated e.g. by Copeland's method.