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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number
2005030.