In this paper we explore the possibility of deriving consensus rankings by solving consensus optimization problems, characterizing consensus rankings as suitable complete order relations minimizing the average Kemeny-Snell distance to the individual rankings. This optimization problem can be expressed as a binary programming (BP) problem which can typically be solved reasonably efficiently.
|Title of host publication||Operations Research Proceedings 2009 (Selected Papers of the Annual International Conference of the German Operations Research Society/GOR)|
|Editors||Berhard Fleischmann, Karl Heinz Borgwardt, Robert Klein, Axel Tuma|
|Place of Publication||Berlin Heidelberg|
|Pages||401 - 406|
|Publication status||Published - 1 Nov 2009|