Graph theory: Difference between revisions

Line 16:

Weak Condorcet winner - The same as the Condorcet winner except arrows may point back from other candidates towards them.

Weak Condorcet loser - The same as the Condorcet loser except arrows may point away from them towards other candidates.</blockquote>The [[Schulze method]] in particular can be thought of in terms of [[Beatpath|beatpaths]], which are defined for an ordered set of candidates such that on a graph representing pairwise preferences, an arrow points from the first candidate to the second, the second to the third, etc. all the way until the last candidate. A [[Beat-or-tie path|beat-or-tie path]] is the same except an arrow may point both ways between any pair of candidates in the beatpath.

Weak Condorcet loser - The same as the Condorcet loser except arrows may point away from them towards other candidates.</blockquote>The [[Schulze method]] in particular can be thought of in terms of [[Beatpath|beatpaths]], which are defined for an ordered set of candidates such that on a graph representing pairwise preferences, an arrow points from the first candidate to the second, the second to the third, etc. all the way until the last candidate. A [[Beat-or-tie path|beat-or-tie path]] is the same except an arrow may point both ways between any pair of candidates ordered next to each other in the beatpath.

== Also see ==