Constructing an aggregated relation with a minimum distance from the expert preferences

V. N. Nefedov ; S. O. Smerchinskaya ; N. P. Yashina

Prikladnaâ diskretnaâ matematika, no. 4 (2018), pp. 120-132.

Résumé

The paper considers the problem of collective choice. Profile of experts' individual preferences on the set of alternatives can be given by binary relations or numerical evaluations of alternatives. Methods for constructing preferences matrices for various types of expert information are proposed, as well as methods for forming an aggregated relation that satisfies the condition of minimizing the total distance to expert preferences. Let expert preferences in the form of binary relations $\rho_1,\rho_2,\ldots ,\rho_m$ are given by the vertex adjacency matrices $R^1,R^2,\ldots ,R^m$ of the corresponding digraphs. The distance between the relations is defined as the Hamming distance. We prove that the aggregate relation,which is built according to the rule of “the majority of experts”, satisfies the condition of minimum distance from expert preferences. In the case, when the profile of expert preferences is given by relations of a strict order and the number of experts is odd, the aggregated relation is unique. Let the estimates of the alternatives $a_1,a_2,\ldots ,a_n$ by the $t$-th expert be given in the form of a vector $h^t=\langle h_1^t,h_2^t,\ldots ,h_n^t\rangle$ with positive real components. Then the elements of the preference matrix $R^t=\|r_{ij}^t\|$ have the form $r_{ij}^t=\dfrac{h_i^t}{h_i^t+h_j^t}$, if the values of estimates on the scale are maximized. We prove that the aggregated preference relation depends on the choice of the formula for determining the distance between the preferences matrices. When you specify the distance through the module of the difference of the preference matrices elements, then the total distance is minimal if all the elements of the aggregated matrix are equal to the medians of the corresponding elements of expert matrices. When you specify the distance through the square of the elements difference, then the distance is minimal if all the elements of the aggregated matrix are equal to the arithmetic means of the corresponding elements of expert matrices. The developed technique can be used to solve multi-criteria problems in the assessment of alternatives in the scales of relations.

Détail

Keywords: collective choice, aggregate relation, profile of experts' individual preferences, minimum distance from preferences, majority graph.

Bibliographie

[1] Mirkin B. G., Group Choice, V. H. Winston Sons Publ., 1979, 252 pp. | MR | MR

[2] Petrovskiy A. B., Decision Making Theory, Akademiya Publ., M., 2009, 400 pp. (in Russian)

[3] Moulin H., Axioms of Cooperative Decision Making, Cambridge University Press, Cambridge, 1988 | MR | Zbl

[4] Osipova V. A., Podinovski V. V., Yashina N. P., “On non-contradictory extension of preference relations in decision making problems”, USSR Comput. Math. and Math. Physics, 24 (1984), 128–134 | DOI | MR | Zbl

[5] Nefyodov V. N., Osipova V. A., Smerchinskaya S. O., Yashina N. P., “Non-contradictory aggregation of strict order relations”, Russian Mathematics, 62 (2018), 61–73 | DOI | Zbl

[6] Smerchinskaya S. O., Yashina N. P., “On an algorithm for pairwise comparison of alternatives in multi-criteria problems”, Intern. J. Modeling, Simulation, and Scientific Computing, 9:1 (2018) | DOI

[7] Nefedov V. N., Osipova V. A., Discrete Mathematics Course, MAI Publ., M., 1992, 262 pp. (in Russian)

[8] Electronic textbook on decision making theory

[9] Smerchinskaya S. O., Yashina N. P., “Analysis of the competence of experts in the problems of group selection”, Inform. Telecomm. Technologies, 2012, no. 15, 103–115 (in Russian)