In this brief note we consider rank aggregation, a popular method in voting theory, social choice, business decisions, etc. Mathematically the problem is to find a permutation-viewed as a vector-that minimizes the sum of the l(1)-distances to a given family of permutations. The problem may be solved as an assignment problem and we establish several properties of optimal solutions in this problem. (C) 2010 Elsevier Ltd. All rights reserved.
机构:
Calif Polytech State Univ San Luis Obispo, Dept Math, San Luis Obispo, CA 93407 USACalif Polytech State Univ San Luis Obispo, Dept Math, San Luis Obispo, CA 93407 USA
Mendes, Anthony
AMERICAN MATHEMATICAL MONTHLY,
2007,
114
(05):
: 437
-
440