Kemeny rank aggregation is NP-complete already for profiles of three voters, resolving an open problem of Dwork et al. (2001).
and Deng, Xiaotie , title =
1 Pith paper cite this work, alongside 40 external citations. Polarity classification is still indexing.
1
Pith paper citing it
40
external citations · OpenAlex
fields
cs.GT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Kemeny Rank Aggregation is NP-Hard for Three Voters
Kemeny rank aggregation is NP-complete already for profiles of three voters, resolving an open problem of Dwork et al. (2001).