Uncovered set: Difference between revisions
→Example
(→Notes) |
|||
Line 48:
|(1-2)=-1
|}
Notice that the Smith set includes all candidates (this can be seen by observing that there is a [[beatpath]] of x>y>z>v>x, or alternatively by observing that no matter how many candidates you look at from top to bottom, there is still some candidate outside of the group being looked at that one of the candidates in the group lose or tie to). But the uncovered set is all candidates except z; this is because y>z and all candidates who beat y (just x) also beat z. <ref>https://economics.stackexchange.com/a/27691</ref> (Notice that the Copeland set is even smaller; it is just
An alternative way of understanding the uncovered set in this example is to show the size of the smallest-size beatpath from each candidate to another, if one exists (if x>y is 1 here, this means x pairwise beats y. If it's 2, it means x pairwise beats someone who pairwise beats y, etc.). Any candidate with a smallest-size beatpath of 3 or more to another candidate is not in the uncovered set:
| |||