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
A simple Smith set solver for ranked-choice ballots. https://pages.uoregon.edu/tgorordo/files/smithy/src/cgi/form.html
11 commits 1 branch 2 tags 1.9 MiB
Find a file
Thomas (Tom) C. Gorordo 4cc6f98273
fix form response backlinks
2026-05-22 03:51:59 -07:00
src fix form response backlinks 2026-05-22 03:51:59 -07:00
test some formatting and add cli compilation 2026-05-20 12:04:17 -07:00
justfile debug cgi interface 2026-05-22 02:43:43 -07:00
pyproject.toml some formatting and add cli compilation 2026-05-20 12:04:17 -07:00
README.md Update README.md 2026-05-22 03:14:41 -07:00
requirements.txt some formatting and add cli compilation 2026-05-20 12:04:17 -07:00
shell.nix init. core algorithm, initial testing, basic cli. 2026-05-20 11:39:03 -07:00
smithy.spec implement cgi interface 2026-05-22 01:07:50 -07:00
uv.lock init. core algorithm, initial testing, basic cli. 2026-05-20 11:39:03 -07:00

README.md

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).