A branch and bound algorithm to construct a consensus ranking based on Kendall’s T

Johan Springael and Wim de Keyser

Working Papers from University of Antwerp, Faculty of Business and Economics

Abstract: The aim of this paper is to present a branch and bound algorithm, which allows the construction of a consensus ranking out of a set of complete rankings over all alternatives. Each ranking of this set corresponds to the judgement of a decision maker with respect to the given list of alternatives. The method itself is based on the use of Kendall’s rankcorrelation coefficient so as to be able to compare the decision makers’ rankings, and to take the ordinal character of the rankings fully into account. Through the introduction of the concept of piecewise rankcorrelation coefficients, a recursion formula is derived, which enables one to obtain the necessary tool to setup the branch and bound algorithm.

Keywords: Group decision support; Rankcorrelation; Kendall’s ?; Branch and bound algorithm (search for similar items in EconPapers)
Pages: 11 pages
References: Add references at CitEc
Citations:

Downloads: (external link)
https://repository.uantwerpen.be/docman/irua/309607/c76abd8d.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ant:wpaper:2005030

Access Statistics for this paper

More papers in Working Papers from University of Antwerp, Faculty of Business and Economics Contact information at EDIRC.
Bibliographic data for series maintained by Joeri Nys ().