Ranked Robin: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
| Line 13: | Line 13: | ||
{{Definition|Elect the candidate who pairwise beats the greatest number of other candidates.}} |
{{Definition|Elect the candidate who pairwise beats the greatest number of other candidates.}} |
||
== Tie-breaking |
== Tie-breaking mechanics == |
||
If there is a tie (including [[Condorcet paradox|Condorcet cycles]]), use the '''1<sup>st</sup> Degree''' tie-breaking method to resolve it. If there is still a tie, use the '''2<sup>nd</sup> Degree''' tiebreaker, and so on. |
If there is a tie (including [[Condorcet paradox|Condorcet cycles]]), use the '''1<sup>st</sup> Degree''' tie-breaking method to resolve it. If there is still a tie, use the '''2<sup>nd</sup> Degree''' tiebreaker, and so on. |
||