Update README.md

This commit is contained in:
Thomas (Tom) C. Gorordo 2026-06-04 15:07:22 -07:00 committed by GitHub
parent bc146d523d
commit 51d651bee6
No known key found for this signature in database
GPG key ID: B5690EEEBB952194

View file

@ -14,7 +14,7 @@ of Condorcet elections. Internally, repeated ballots are compressed/cache-counte
pairwise evaluation to improve performance over duplicate rankings. pairwise evaluation to improve performance over duplicate rankings.
This is all overkill for small elections, but is fun. 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 majority coalition). (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).
## Usage ## Usage