Part 1. General problems of the intellectual systems theory

On a strict consensus ranking algorithm

V. A. Antonyuk

Lomonosov Moscow State University

Abstract: A combinatorial approach to the strict consensus ranking problem for a given set of nonstrict orderings of alternatives is considered. A concept of light score matrix (skew-symmetric) is introduced providing more simple and clear optimization process and its result. Some heuristic search procedures are formulated allowing optimal strict consensus rankings (including multiple) to be found in different cases.

Keywords: rankings, Kemeny median, skew-symmetric matrices, parallel generation of permutations, Julia language, OpenCL.