From e9c263a8c529b65ea8a666c253bb623856c97e8a Mon Sep 17 00:00:00 2001
From: "Thomas (Tom) C. Gorordo" <57684088+tgorordo@users.noreply.github.com>
Date: Thu, 4 Jun 2026 12:48:24 -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 fdc2f66..b709203 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 IRV 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 candidate who wins all paths).
+(TODO: for small elections -because enumerating all IRV 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 candidate who wins all paths and builds a winning coalition willing to elect them as delegate).
 
 
 ## Usage