Name
Zhukov Mikhail Stanislavovich
Scholastic degree
—
Academic rank
—
Honorary rank
—
Organization, job position
Bauman Moscow State Technical University
Web site url
—
Articles count: 1
In various applications, it is necessary to analyze
several expert orderings, i.e. clustered rankings
objects of examination. These areas include
technical studies, ecology, management, economics,
sociology, forecasting, etc. The objects can be some
samples of products, technologies, mathematical
models, projects, job applicants and others. In the
construction of the final opinion of the commission
of experts, it is important to find clustered ranking
that averages responses of experts. This article
describes a number of methods for clustered
rankings averaging, among which there is the
method of Kemeny median calculation, based on the
use of Kemeny distance. This article focuses on the
computing side of the final ranking among the
expert opinions problem by means of median
Kemeny calculation. There are currently no exact
algorithms for finding the set of all Kemeny
medians for a given number of permutations
(rankings without connections), only exhaustive
search. However, there are various approaches to
search for a part or all medians, which are analyzed
in this study. Zhikharev's heuristic algorithms serve
as a good tool to study the set of all Kemeny
medians: identifying any connections in mutual
locations of the medians in relation to the
aggregated expert opinions set (a variety of expert
answers permutations). Litvak offers one precise
and one heuristic approaches to calculate the median
among all possible sets of solutions. This article
introduces the necessary concepts, analyzes the
advantages of median Kemeny among other possible searches of expert orderings. It identifies
the comparative strengths and weaknesses of
examined computational ways