Kemeny–Young method: Difference between revisions

Content added Content deleted
No edit summary
No edit summary
Line 28: Line 28:


It can be shown that this ranking is the one with the lowest distance score. Therefore, the winning ranking is Nashville>Chattanooga>Knoxville>Memphis, and so the winning candidate is Nashville.
It can be shown that this ranking is the one with the lowest distance score. Therefore, the winning ranking is Nashville>Chattanooga>Knoxville>Memphis, and so the winning candidate is Nashville.

== Notes ==
The Kemeny-Young ranking is a [[Smith set ranking]]. This is because any candidate in the n-th Smith set will always be ranked higher than any candidate in a lower Smith set by more voters than vice versa by definition (because the n-th Smith set candidate pairwise beats all candidates in lower Smith sets), so if you take any non-Smith set ranking and minimally modify it to become a Smith set ranking, this will always reduce the distance score. In other words, if there is some ranking which puts a candidate in the n-th Smith set after some candidate in a lower Smith set, then modifying it to swap the two will reduce the distance created by that pair of candidates.

See [[Pairwise sorted methods]], which do what is called "Local Kemenization" to produce a ranking, while being cloneproof.


==External links==
==External links==