mirror of
https://github.com/tgorordo/smithy.git
synced 2026-06-05 16:22:15 -07:00
291 B
291 B
Smithy
A simple smith set solver for ranked-choice ballots.
The Smith set is the minimal set of candidates which can beat all others pairwise - if there is a single winner in the set they are guaranteed the standard Condorcet i.e. Majority winner (they beat all others pairwise).