Journal Ratings and Their Consensus Ranking

Stefan Theußl, Kurt Hornik

Publication: Chapter in book/Conference proceedingContribution to conference proceedings


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.
Original languageEnglish
Title of host publicationOperations 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 PublicationBerlin Heidelberg
Pages401 - 406
ISBN (Print)978-3-642-00141-3
Publication statusPublished - 1 Nov 2009

Cite this