Kemeny Voting Scheme

Kemeny voting aims to find a consensus ranking of candidates from a set of individual preferences, minimizing disagreements using a distance metric (like Kendall-tau). Recent research extends this to "setwise" Kemeny methods, considering not just pairwise comparisons but also the agreement within groups of three candidates, leading to improved properties like stronger resistance to manipulation. This research focuses on developing efficient algorithms to solve the computationally hard problem of finding optimal setwise Kemeny rankings, leveraging theorems to reduce the search space. These advancements have implications for fair and robust decision-making in various fields, including social choice and biological applications.