Improved Condorcet Approval: Difference between revisions

Content added Content deleted
imported>KVenzke
imported>KVenzke
Line 42: Line 42:


==Variants==
==Variants==
===Variant: Defeat strength minimum===
It is possible to disregard defeats below a certain strength. This could be done if it were thought undesirable to find that the set ''S'' is empty, when one candidate would have made it into the set except for one very weak defeat.

Define ''q'' to be the minimum percentage of the vote which must be on the winning side of a pairwise defeat in order for it to be counted. Let ''v'' signify the total number of voters. Then change step #4 above to:

: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] ''and'' v[y,x]>''qv''.

When ''q'' is set to 50%, then the method is equivalent to [[Majority Defeat Disqualification Approval]], and all values of t[a,b] (for any candidates ''a'' and ''b'') can be assumed to be zero without affecting the result.

[[MDDA]] fails [[Plurality criterion|Plurality]], however. It's likely that setting ''q'' to anything other than 0% will create this problem.

===Variant: "Tied and approved" rather than "Tied at the top"===
===Variant: "Tied and approved" rather than "Tied at the top"===
The above definition defines t[a,b] to be the number of voters tying ''a'' and ''b'' in the top position. This is the most conservative change from [[Condorcet//Approval]], since it's only in this case that we can be sure the voter would like to do whatever is necessary to ensure that the winner is either ''a'' or ''b''.
The above definition defines t[a,b] to be the number of voters tying ''a'' and ''b'' in the top position. This is the most conservative change from [[Condorcet//Approval]], since it's only in this case that we can be sure the voter would like to do whatever is necessary to ensure that the winner is either ''a'' or ''b''.