Aggregating rankings with positional constraints

Farzad Farnoud Hassanzadeh, Olgica Milenkovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We consider the problem of rank aggregation, where the goal is to assemble ordered lists into one consensus order. Our contributions consist of proposing a new family of distance measures that allow for incorporating practical ranking constraints into the aggregation problem formulation; showing how such distance measures arise from a generalization of Kemeny's axioms of the Kendall r distance; and proving that special classes of the proposed distances may be computed in polynomial time.

Original languageEnglish (US)
Title of host publication2013 IEEE Information Theory Workshop, ITW 2013
StatePublished - Dec 1 2013
Event2013 IEEE Information Theory Workshop, ITW 2013 - Seville, Spain
Duration: Sep 9 2013Sep 13 2013

Publication series

Name2013 IEEE Information Theory Workshop, ITW 2013


Other2013 IEEE Information Theory Workshop, ITW 2013

ASJC Scopus subject areas

  • Information Systems


Dive into the research topics of 'Aggregating rankings with positional constraints'. Together they form a unique fingerprint.

Cite this