Beatpath: Difference between revisions
→Notes
No edit summary |
(→Notes) |
||
Line 128:
== Notes ==
[[Pairwise Sorted Methods]] produce a beat-or-tie path ranking of the candidates.
By analogy to how Condorcet cycles with n candidates are called n-cycles, perhaps paths with n candidates could be called (n-1)-paths. For example, A>B>C would be a 2-path.
==See also==
* [[Beatpath examples 3|Examples with 3 candidates]]
| |||