A branch and bound algorithm to construct a consensus ranking based on Kendall's t
AbstractThe 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 InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number 2005030.
Length: 11 pages
Date of creation: Dec 2005
Date of revision:
Contact details of provider:
Postal: Prinsstraat 13, B-2000 Antwerpen
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2006-02-26 (All new papers)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys).
If references are entirely missing, you can add them using this form.