www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/22979

Title: Aggregation of Partial Rankings : An Approach Based on the Kemeny Ranking Problem
Authors: Nápoles Ruiz, Gonzalo
Dikopoulou, Zoumpolia
Papageorgiou, Elpiniki
Bello, Rafael
Vanhoof, Koen
Issue Date: 2015
Publisher: Springer International Publishing
Citation: Rojas, Ignacio; Joya, Gonzalo; Catala, Andreu (Ed.). Advances in Computational Intelligence, Springer International Publishing,p. 343-355
Series/Report: Lecture Notes in Computer Science (LNCS)
Series/Report no.: 9095
Abstract: Aggregating the preference of multiple experts is a very old problem which remains without an absolute solution. This assertion is supported by the Arrow’s theorem: there is no aggregation method that simultaneously satisfies three fairness criteria (non-dictatorship, independence of irrelevant alternatives and Pareto efficiency). However, it is possible to find a solution having minimal distance to the consensus, although it involves a NP-hard problem even for only a few experts. This paper presents a model based on Ant Colony Optimization for facing this problem when input data are incomplete. It means that our model should build a complete ordering from partial rankings. Besides, we introduce a measure to determine the distance between items. It provides a more complete picture of the aggregated solution. In order to illustrate our contributions we use a real problem concerning Employer Branding issues in Belgium.
URI: http://hdl.handle.net/1942/22979
DOI: 10.1007/978-3-319-19222-2_29
ISI #: 000363699900029
ISBN: 9783319192215
ISSN: 0302-9743
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version287.16 kBAdobe PDF
Peer-reviewed author version744.08 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.