Top-k list aggregation: mathematical formulations and polyhedral comparisons

DOI10.1007/978-3-031-18530-4_4MaRDI QIDQ6166889zbMATH OpenOpenAlexFDO

Authors 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

rank aggregationmixed integer programmingKendall tau distancepolyhedral analysistop-\(k\) list aggregation

Mathematics Subject Classification ID

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

Recommendations

• Comparing Top k Lists
• scientific article; zbMATH DE number 2079318
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Approximate and dynamic rank aggregation

Cites work

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

Cited in

(1)

• Parameterized top-\(K\) algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166889)