kemeny

JS library for ranked voting systems

This repository consists of a benchmark of various text similarity measures for Natural Language Generation (NLG) evaluation, on multiple datasets, and provides a way to aggregate these measures.

Implementation of Davenport's algorithm for computing Kemeny rankings

Easy to use voting methods. Uses Svelte and Tailwind CSS.

C code to compute median orders (ordres médians), written by Alain Guénoche

Supplementary material for “Characterizing Positional Scoring Rules Through Kemeny Approximability.”: exact certificates and verifier for the approximation ratio of Borda’s rule on 2 to 7 candidates, and checks of the three-candidate theorem and the two-ranking conjecture.