Anonymous user
Improved Condorcet Approval: Difference between revisions
→Definition: The version comprehensible to the layperson should go first
(→Links: fix link to pt to right msg! -kv) |
(→Definition: The version comprehensible to the layperson should go first) |
||
Line 2:
==Definition==
#The voter submits a ranked ballot. She is permitted to give more than one candidate the same ranking, and is not obliged to rank every candidate.
#Identify all of the pairwise losses.▼
#Disregard any pairwise loss that can be reversed or turned into a pairwise tie if the voters ranking both candidates equal in first place (possibly with other candidates) are counted in favor of the pairwise loser.▼
#If any candidates do not have any pairwise loss, disqualify all the candidates who do have some pairwise loss.▼
#The voter submits a ranked ballot, with equal-ranking and truncation permitted.
#A voter is deemed to have "
#Let v[a,b] signify the number of voters ranking candidate ''a'' above candidate ''b'', and let t[a,b] signify the number of voters ranking ''a'' and ''b'' equally at the top of the ranking (possibly tied with other candidates).
#Define a set ''S'' of candidates, which contains every candidate ''x'' for whom there is no other candidate ''y'' such that v[x,y]+t[x,y]<v[y,x].
#If ''S'' is empty, then let ''S'' contain all the candidates.
#Elect the candidate in ''S'' with the greatest approval.
▲An equivalent definition:
▲#Identify all of the pairwise losses.
▲#Disregard any pairwise loss that can be reversed or turned into a pairwise tie if the voters ranking both candidates equal in first place (possibly with other candidates) are counted in favor of the pairwise loser.
▲#If any candidates do not have any pairwise loss, disqualify all the candidates who do have some pairwise loss.
▲#Elect the (non-disqualified) candidate with the greatest approval.
==Comments==
| |||