An algorithm for rank aggregation problem

doi:10.1016/j.amc.2006.12.065

An algorithm for rank aggregation problem

2007-06-01

2

PRE

AI

DOI：10.1016/j.amc.2006.12.065

Original

Original request for help

Save

Abstract

En 中文

The rank aggregation problem is an old problem which arises in many different settings. Let A = {1, 2,..., n} be the set of alternatives. Suppose delta(1), delta(...)(2), delta(k) are some individual preferences on A. The problem is to find a rank ordering delta such that Sigma(1 <= i <= d) (delta,delta(i)) is the minimum among all rank orderings, where d is a metric on the set of the rank orderings on A defined by Keen. We know that this problem is NP-hard. In this paper, we introduce an algorithm such that by using any rank ordering as an input, the output is a rank ordering which satisfies the extended Condorcet property. Also for a set of individual preferences, we introduce a rank ordering such that if we consider it as an input of the algorithm, we expect that the output is an optimal rank aggregation. (c) 2006 Elsevier Inc. All rights reserved.

Keywords:

tournament

ranking

expectation matrix

An algorithm for rank aggregation problem

Abstract

Journal

Organization

Cited Papers