tgorordo/smithy
1
0
Fork 0
mirror of https://github.com/tgorordo/smithy.git synced 2026-06-05 16:22:15 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

init. core algorithm, initial testing, basic cli.

Browse source
This commit is contained in:
Thomas (Tom) C. Gorordo 2026-05-20 11:39:03 -07:00
commit 8836c49091
Signed by: tgorordo
GPG key ID: 0CBED22BB0D94490
12 changed files with 2297 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

5
README.md Normal file
View file

@ -0,0 +1,5 @@
# 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).