A note on permutations and rank aggregation

Authors:
Geir Dahl;Harald Minken
Affiliations:
Center of Mathematics for Applications, Department of Informatics, University of Oslo, P.O. Box 1053 Blindern, NO-0316 Oslo, Norway;Institute of Transport Economics, N-0349 Oslo, Norway
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2010

Citing 10
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
On the classification and aggregation of hierarchies with different constitutive elements

Fundamenta Informaticae
An efficient approach for the rank aggregation problem

Theoretical Computer Science
Comparing Partial Rankings

SIAM Journal on Discrete Mathematics
A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem

Fundamenta Informaticae
A Multi-Criteria Decision Method Based on Rank Distance

Fundamenta Informaticae
A 0-1 knapsack model for evaluating the possible Electoral College performance in two-party US presidential elections

Mathematical and Computer Modelling: An International Journal
Complexity and the geometry of voting

Mathematical and Computer Modelling: An International Journal
Consistency without neutrality in voting rules: When is a vote an average?

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

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.