1 citations · 1 across the 8 of their papers we have counts for
1 paper · 1 filter
Piotr Faliszewski, Krzysztof Sornat, Stanisław Szufa +1
In the k-Kemeny problem, we are given an ordinal election, i.e., a collection of votes ranking the candidates from best to worst, and we seek the smallest number of swaps of adjace…