A note on permutations and rank aggregation

被引:1
|
作者
Dahl, Geir [1 ]
Minken, Harald [1 ]
机构
[1] Univ Oslo, Dept Informat, Ctr Math Applicat, NO-0316 Oslo, Norway
关键词
Ranking; Voting; Permutations; Assignment problem;
D O I
10.1016/j.mcm.2010.02.052
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:380 / 385
页数:6
相关论文
共 50 条