Consolidation of Individual Rankings by the Method of Branches And Bounds
Tóm tắt
In the problem of collective choice, an algorithm is proposed for constructing an optimal aggregate ranking that is closest to all individual strict rankings in the sense of the Kemeny median. The application of the branch-and-bound method allows problems of large dimensions to be solved and can also be used in the case when individual preferences are arbitrary binary relations.
Tài liệu tham khảo
B. G. Mirkin, Group Choice Problem (Nauka, Moscow, 1974) [in Russian].
H. Moulin, Axioms of Cooperative Decision Making (Cambridge Univ. Press, Cambridge, 2013).
H. P. Young, “Condorcet’s theory of voting,” Am. Polit. Sci. Rev., No. 82, 1231–1244 (1988).
A. B. Petrovsky, Decision Theory (Akademiya, Moscow, 2009) [in Russian].
V. N. Nefedov, V. A. Osipova, C. O. Smerchinskaya, and N. P. Yashina, “Non-contradictory aggregations of relations of strict order,” Russ. Math. (Iz. VUZ) 62 (5), 61–73 (2018).
B. G. Litvak, Expert Information: Methods of Obtaining and Analyzing (Radio Svyaz’, Moscow, 1982) [in Russian].
V. P. Korneenko, Methods of Multi-Criteria Evaluation of Objects with a Multi-Level Structure of Performance Indicators (MAKS Press, Moscow, 2018) [in Russian].
W. D. Cook, “Distance-based and ad hoc consensus models in ordinal preference ranking,” Eur. J. Operat. Res., No. 172, 369–385 (2006).
V. N. Nefedov, “Some properties of a linearly ordered median for an odd number of linear asymmetric ratios,” Available from VINITI No. 62–B2021 (2021).
V. N. Nefedov, Discrete Optimization Problems (MAI, Moscow, 1993) [in Russian].