Construction of the aggregated preference relations on the basis of a loaded majority graph
Mathematics. Physics. Mechanics
Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia
AbstractChoice problem arise during the design and creation of modern rocket and space technology, for comparative analysis of technical means, as well as decision making in terms of managing non-standard aircraft.
In this paper we propose an algorithm for aggregating expert estimates, given the strict preference. Aggregation of preference relation reflects the individual preferences of experts and does not contain any circuits. The method is based on the construction of a loaded majority graph. The algorithm containes an original procedure, the destruction of contours.
Keywords:decision making, group selection, majority graph, preference relation, ranking, aggregated preference, Hamming distance, coefficients experts