Top-k list aggregation: mathematical formulations and polyhedral comparisons
From MaRDI portal
Publication:6166889
DOI10.1007/978-3-031-18530-4_4zbMATH Open1528.90202OpenAlexW4313063023MaRDI QIDQ6166889FDOQ6166889
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
Recommendations
rank aggregationmixed integer programmingKendall tau distancepolyhedral analysistop-\(k\) list aggregation
Cites Work
- Distance-based and ad hoc consensus models in ordinal preference ranking
- NON-NULL RANKING MODELS. I
- A NEW MEASURE OF RANK CORRELATION
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Comparing Top k Lists
- Handbook of Computational Social Choice
- Measures of Association for Cross Classifications. II: Further Discussion and References
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
Cited In (1)
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)