Talk:Beatpath: Difference between revisions
no edit summary
(Created page with "It seems to me that the Smith set can be defined simply as the smallest group of candidates such that they have a beatpath to all other candidates, but no other candidates hav...") |
No edit summary |
||
Line 1:
<small>It seems to me that the Smith set can be defined simply as the smallest group of candidates such that they have a beatpath to all other candidates, but no other candidates have a beatpath back to them? Why is the beat-or-tie path concept necessary?</small> Edit: Figured it out, if A beats B beats C, with C tying A, then A has a beatpath to C, but C doesn't have a beatpath back, yet C is still in the Smith set. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 05:57, 18 March 2020 (UTC)
|