Sciweavers

32
Voted
IWPEC
2009
Springer

Improved Parameterized Algorithms for the Kemeny Aggregation Problem

14 years 6 months ago
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, called votes, over a set of alternatives, called candidates, into a single preference list that has the minimum total τ-distance from the votes. The τ-distance between two preference lists is the number of pairs of candidates that are ordered differently in the two lists. We study the problem for preference lists that are total orders. We develop algorithms of running times O∗
Narges Simjour
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where IWPEC
Authors Narges Simjour
Comments (0)