TY - GEN
T1 - Aggregating rankings with positional constraints
AU - Hassanzadeh, Farzad Farnoud
AU - Milenkovic, Olgica
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84893271077&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893271077&partnerID=8YFLogxK
U2 - 10.1109/ITW.2013.6691240
DO - 10.1109/ITW.2013.6691240
M3 - Conference contribution
AN - SCOPUS:84893271077
SN - 9781479913237
T3 - 2013 IEEE Information Theory Workshop, ITW 2013
BT - 2013 IEEE Information Theory Workshop, ITW 2013
T2 - 2013 IEEE Information Theory Workshop, ITW 2013
Y2 - 9 September 2013 through 13 September 2013
ER -