Publication
Title
A branch and bound algorithm to construct a consensus ranking based on Kendall's t
Author
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 Kendalls 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 rankcorrela- tion coefficients, a recursion formula is derived, which enables one to obtain the necessary tool to setup the branch and bound algorithm.
Language
English
Source (series)
Research paper / UA, Faculty of Applied Economics ; 2005:30
Publication
Antwerp : UA, 2005
Volume/pages
11 p.
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Record
Identification
Creation 08.10.2008
Last edited 23.12.2015
To cite this reference