Abstract

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 ℓ 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call