Jump to content

Resolvability criterion

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Monkbot (talk | contribs) at 03:25, 14 October 2019 (→‎top: Task 16: replaced (0×) / removed (1×) deprecated |dead-url= and |deadurl= with |url-status=;). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Methods that satisfy both versions include approval voting, range voting, Borda count, instant-runoff voting, minimax Condorcet, plurality, Tideman's ranked pairs,[1] and Schulze.[2]

Methods that violate both versions include Copeland's method and the Slater rule.[citation needed]

References

  1. ^ "Proof MAM is resolvable and reasonably deterministic". alumnus.caltech.edu. Retrieved 2018-07-21.
  2. ^ Schulze, Markus (3 March 2017). "A New Monotonic, Clone-Independent, Reversal Symmetric, and Condorcet-Consistent Single-Winner Election Method" (PDF).
Retrieved from "https://en.wikipedia.org/w/index.php?title=Resolvability_criterion&oldid=921138636"