Content-Length: 138716 | pFad | http://en.wikipedia.org/wiki/Sequential_elimination_method

Sequential elimination method - Wikipedia Jump to content

Sequential elimination method

From Wikipedia, the free encyclopedia

The sequential elimination methods are a class of voting systems that repeatedly eliminate the last-place finisher of another voting method until a single candidate remains.[1] The method used to determine the loser is called the base method. Common are the two-round system, instant-runoff voting, and some primary systems.

Instant-runoff voting is a sequential loser method based on plurality voting, while Baldwin's method is a sequential loser method based on the Borda count.[2]

Properties

[edit]

Proofs of criterion compliance for loser-elimination methods often use mathematical induction, and so can be easier than proving such compliance for other method types. For instance, if the base method passes the majority criterion, a sequential loser-elimination method based on it will pass mutual majority. Loser-elimination methods are also not much harder to explain than their base methods.[2]

However, loser-elimination methods often fail monotonicity due to chaotic effects (sensitivity to initial conditions): the order in which candidates are eliminated can create erratic behavior.[1]

If the base method passes independence from the weakest alternative, the loser-elimination method is equivalent to the base method.[1] In other words, methods that are immune to weak spoilers are already "their own" elimination methods, because eliminating the weakest candidate does not affect the winner.

If the base method satisfies a criterion for a single candidate (e.g. the majority criterion or the Condorcet criterion), then a sequential loser method satisfies the corresponding set criterion (e.g. the mutual majority criterion or the Smith criterion), so long as eliminating a candidate can't remove another candidate from the set in question. This is because when all but one of the candidates of the set have been eliminated, the single-candidate criterion applies to the remaining candidate.[1]

References

[edit]
  1. ^ a b c d Xia, Lirong; Lang, Jérôme; Ying, Mingsheng (2007-06-25). "Sequential voting rules and multiple elections paradoxes". Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge - TARK '07. New York, NY, USA: Association for Computing Machinery. pp. 279–288. doi:10.1145/1324249.1324286. ISBN 978-1-4503-7841-3.
  2. ^ a b Bag, PK; Sabourian, H; Winter, E. "Sequential Elimination vs. Instantaneous Voting" (PDF). Mimeo.

Further reading

[edit]








ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: http://en.wikipedia.org/wiki/Sequential_elimination_method

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy