Intransitivity in multiple solutions of Kemeny Ranking Problem

Abstract

Kemeny rule is one of deeply justified ways to solve the problem allowing to find such a linear order (Kemeny ranking) of alternatives that a distance from it to the initial rankings (input preference profile) is minimal. The approach can give considerably more than one optimal solutions. The multiple solutions (output profile) can involve intransitivity of the input profile. Favorable obstacle in dealing with intransitive output profile is that the intransitive cycles are lexicographically ordered what can help when algorithmically revealing them.