Single Contest: Difference between revisions
→Definition: examples |
→Comments: criteria comments |
||
Line 13: | Line 13: | ||
Manipulating which contest will be selected as the "single contest" is not straightforward. The only way to vote against a contest (because one foresees that it won't resolve favorably) is to approve neither candidate involved. |
Manipulating which contest will be selected as the "single contest" is not straightforward. The only way to vote against a contest (because one foresees that it won't resolve favorably) is to approve neither candidate involved. |
||
Single Contest satisfies Condorcet Loser, but not Condorcet: |
|||
40 A>B | C (i.e. only C is disapproved) |
|||
25 B | A>C |
|||
35 C | A>B |
|||
100 |
|||
The Condorcet winner is A. The BC pair is selected as the most important contest, because all voters distinguish between B and C using approval. Then B is elected. |
|||
The method is clone-independent assuming clones of a candidate receive the same approval. It's not monotone, because raising the winner from disapproved to approved on some ballots which already counted to the selected pair (that the winner was part of) could add votes for a different pair where the original winner is pairwise beaten. |
|||
[[Category:Single-winner voting systems]] |
[[Category:Single-winner voting systems]] |
Revision as of 16:42, 17 February 2012
Single Contest is a method devised by Kevin Venzke which, according to his simulations, has very little incentive for insincere ranking and very good sincere Condorcet efficiency. It uses a rank ballot with explicitly-placed approval cutoff, expecting voters to employ approval strategy.
Definition
- Voters fill out rank ballots, with an explicitly-placed approval cutoff. Equal ranking and truncation are allowed.
- If there is a strict majority favorite (not counting equal-top rankings to the majority) then this candidate wins.
- Otherwise, elect the winner of the pairwise contest between the pair of candidates who minimize the number of voters that approved neither one. For example, if no one approved A or B, there are no votes for the AB pair. If everyone voted for at least one of A and B, all votes are for the AB pair.
- If pairs are tied on this measure, break the tie for the pair whose winner has the most voters on his side in that contest (i.e. winning votes). Secondarily, break ties in favor of the pair whose winner has the most approval.
Comments
The method essentially uses the approval scores to guess at the most important two-way contest. It is an approval election for a pair, where you vote for a pair by approving either candidate in that pair. Then the rankings are used to resolve this contest. Two-candidate races don't have strategy incentives.
There is potentially strategy with the majority favorite rule, as creating a majority favorite will end the method prematurely and possibly in a way that a voter prefers.
Manipulating which contest will be selected as the "single contest" is not straightforward. The only way to vote against a contest (because one foresees that it won't resolve favorably) is to approve neither candidate involved.
Single Contest satisfies Condorcet Loser, but not Condorcet:
40 A>B | C (i.e. only C is disapproved) 25 B | A>C 35 C | A>B 100
The Condorcet winner is A. The BC pair is selected as the most important contest, because all voters distinguish between B and C using approval. Then B is elected.
The method is clone-independent assuming clones of a candidate receive the same approval. It's not monotone, because raising the winner from disapproved to approved on some ballots which already counted to the selected pair (that the winner was part of) could add votes for a different pair where the original winner is pairwise beaten.