Compare commits

...

10 commits

Author SHA1 Message Date
Thomas (Tom) C. Gorordo
fc0569e252
Update README.md 2026-06-04 15:23:03 -07:00
Thomas (Tom) C. Gorordo
51d651bee6
Update README.md 2026-06-04 15:07:22 -07:00
Thomas (Tom) C. Gorordo
bc146d523d
Update README.md 2026-06-04 13:23:05 -07:00
Thomas (Tom) C. Gorordo
17c121f0af
Update README.md 2026-06-04 13:04:49 -07:00
Thomas (Tom) C. Gorordo
e9c263a8c5
Update README.md 2026-06-04 12:48:24 -07:00
Thomas (Tom) C. Gorordo
fa24eb5758
Update README.md 2026-06-04 12:35:21 -07:00
Thomas (Tom) C. Gorordo
55f64d1a32
Update README.md 2026-06-04 12:34:54 -07:00
Thomas (Tom) C. Gorordo
3dc8a3cb46
Update README.md 2026-06-04 12:31:35 -07:00
Thomas (Tom) C. Gorordo
845ac38533
Update README.md 2026-06-04 12:30:02 -07:00
Thomas (Tom) C. Gorordo
b24920c15a
Update README.md 2026-06-04 12:19:39 -07:00

View file

@ -14,6 +14,8 @@ of Condorcet elections. Internally, repeated ballots are compressed/cache-counte
pairwise evaluation to improve performance over duplicate rankings.
This is all overkill for small elections, but is fun.
(TODO: for small elections -because enumerating all tie resolution paths scales badly in the event of many tied counts-, optionally resolve nontrivial Smith sets -majoritarian ties- via IRV within the set, at least reducing to an IRV winner set within the Smith set if not likely identifying a unique delegate who wins all paths, having built a plurality coalition amongst the majority winners. This should identify a winning candidate as the best possible focal point for voluntary coordination; if your elections have other priorities you may want to resolve amongst the smith set differently).
## Usage
`smithy` can be used a few different ways: as a CLI command, via a web form upload,