Tournaments determined by three and five voters

Leonid Chindelevitch, Ararat Harutyunyan

The Kemeny median problem asks for a linear order minimizing the total pairwise disagreement with $m$ given rankings of $n$ options; it is NP-hard for every even $m\ge 4$ and ever…