Axiomatic aggregation of incomplete rankings

Erick Moreno-Centeno, Adolfo Escobedo

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)475-488
Number of pages14
JournalIIE Transactions (Institute of Industrial Engineers)
Volume48
Issue number6
DOIs
StatePublished - Jun 2 2016
Externally publishedYes

Fingerprint

Agglomeration
Decision making

Keywords

  • Axiomatic metrics
  • Consensus formation
  • Group decision-making
  • Incomplete rankings
  • Ranking aggregation

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Axiomatic aggregation of incomplete rankings. / Moreno-Centeno, Erick; Escobedo, Adolfo.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 48, No. 6, 02.06.2016, p. 475-488.

Research output: Contribution to journalArticle

@article{eee7195752c04b1c9f2d2b8e81cbd61e,
title = "Axiomatic aggregation of incomplete rankings",
abstract = "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.",
keywords = "Axiomatic metrics, Consensus formation, Group decision-making, Incomplete rankings, Ranking aggregation",
author = "Erick Moreno-Centeno and Adolfo Escobedo",
year = "2016",
month = "6",
day = "2",
doi = "10.1080/0740817X.2015.1109737",
language = "English (US)",
volume = "48",
pages = "475--488",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "6",

}

TY - JOUR

T1 - Axiomatic aggregation of incomplete rankings

AU - Moreno-Centeno, Erick

AU - Escobedo, Adolfo

PY - 2016/6/2

Y1 - 2016/6/2

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

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

KW - Axiomatic metrics

KW - Consensus formation

KW - Group decision-making

KW - Incomplete rankings

KW - Ranking aggregation

UR - http://www.scopus.com/inward/record.url?scp=84958759167&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958759167&partnerID=8YFLogxK

U2 - 10.1080/0740817X.2015.1109737

DO - 10.1080/0740817X.2015.1109737

M3 - Article

AN - SCOPUS:84958759167

VL - 48

SP - 475

EP - 488

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 6

ER -