Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons

DOI10.1007/978-3-031-18530-4_4zbMath1528.90202OpenAlexW4313063023MaRDI QIDQ6166889

Sina Akbari, Adolfo R. Escobedo

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-18530-4_4

zbMATH Keywords

mixed integer programmingrank aggregationKendall tau distancepolyhedral analysistop-\(k\) list aggregation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites Work

• Spectral method and regularized MLE are both optimal for top-\(K\) ranking
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Distance-based and ad hoc consensus models in ordinal preference ranking
• NON-NULL RANKING MODELS. I
• Measures of Association for Cross Classifications. II: Further Discussion and References
• Comparing Top k Lists
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Handbook of Computational Social Choice
• A NEW MEASURE OF RANK CORRELATION
• A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation

This page was built for publication: Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons