Resolvability criterion

From Wikipedia, the free encyclopedia

Resolvability criterion can refer to any voting system criterion whose fulfillment by a voting system indicates a low possibility of the latter returning ties as results.

1. One version of the criterion has the voting system passing if and only if for every (possibly tied) winner in a result, a vote exists, such that when added, makes that winner unique (Nicolaus Tideman).
2. Another version defines it such that the proportion of profiles giving a tie approaches zero as the number of voters increase towards infinity (Douglas R. Woodall).

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.