From fc0569e252d1c97c626fc698a96c0647ce9510a1 Mon Sep 17 00:00:00 2001
From: "Thomas (Tom) C. Gorordo" <57684088+tgorordo@users.noreply.github.com>
Date: Thu, 4 Jun 2026 15:23:03 -0700
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index df9c095..434ed18 100644
--- a/README.md
+++ b/README.md
@@ -14,7 +14,7 @@ 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).
+(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