Axiomatic aggregation of incomplete rankings Academic Article

abstract

• 2016 IIE. In many different applications of group decision-making, individual ranking agents or judges are able to rank only a small subset of all available candidates. However, as we argue in this article, the aggregation of these incomplete ordinal rankings into a group consensus has not been adequately addressed. We propose an axiomatic method to aggregate a set of incomplete rankings into a consensus ranking; the method is a generalization of an existing approach to aggregate complete rankings. More specifically, we introduce a set of natural axioms that must be satisfied by a distance between two incomplete rankings; prove the uniqueness and existence of a distance satisfying such axioms; formulate the aggregation of incomplete rankings as an optimization problem; propose and test a specific algorithm to solve a variation of this problem where the consensus ranking does not contain ties; and show that the consensus ranking obtained by our axiomatic approach is more intuitive than the consensus ranking obtained by other approaches.

authors

• Moreno-Centeno, Erick

published proceedings

• IIE TRANSACTIONS

author list (cited authors)

• Moreno-Centeno, E., & Escobedo, A. R.

citation count

• 19

complete list of authors

• Moreno-Centeno, Erick||Escobedo, Adolfo R

publication date

• June 2016

publisher

• Taylor & Francis  Publisher

published in

• IIE Transactions  Journal

keywords

• Axiomatic Metrics
• Consensus Formation
• Group Decision-making
• Incomplete Rankings
• Ranking Aggregation

Digital Object Identifier (DOI)

• 10.1080/0740817X.2015.1109737

start page

• 475

end page

• 488

volume

• 48

issue

• 6

URL

• http%3A%2F%2Fdx.doi.org%2F10.1080%2F0740817x.2015.1109737