<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><br class=""></div><div class=""><div class=""><div class=""><div><blockquote type="cite" class=""><div class="">On Mar 23, 2018, at 6:36 PM, robert bristow-johnson <<a href="mailto:rbj@audioimagination.com" class="">rbj@audioimagination.com</a>> wrote:</div><div class=""><p class="">
---------------------------- Original Message ----------------------------<br class="">From: "Curt" <<a href="mailto:accounts@museworld.com" class="">accounts@museworld.com</a>><br class="">
--------------------------------------------------------------------------<br class="">
> <a href="https://github.com/tunesmith/condorcet-counter" class="">https://github.com/tunesmith/condorcet-counter</a> <<a href="https://github.com/tunesmith/condorcet-counter" class="">https://github.com/tunesmith/condorcet-counter</a>><br class="">
><br class="">
> I opined a bit in the README but that’s not really the point of the project. I just wanted an easy way to identify Smith and Schwartz sets for myself.<br class="">
</p><p class="">to wit: "<span style="color: rgb(36, 41, 46); font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, Arial, sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol"; font-size: 16px;" class="">It's this author's view that a
method should only be called a Condorcet if it is limited to identifying the Smith Set,</span>"</p><p class="">seems to me that your view is that the current definition of "Condorcet-compliant-method" should be changed. so is Tideman Ranked-Pairs or Schulze Beat-Path methods not
"Condorcet methods"?</p></div></blockquote></div><div class="">Yes, that is my view. They should not be called “Condorcet Methods”, because they are not guaranteed to select the candidate(s) that would defeat all other candidates.</div><div class=""><br class=""></div><div class="">There is a clear difference between a “Condorcet Method” that finds a Condorcet Winner or Smith Set, and a “tiebreaking" method that tries to pick a single winner from a multi-candidate Smith Set. The latter fails criteria that the former does not. I don’t know what we should call these tiebreaking algorithms - perhaps they are not quite “tiebreaking” methods since a cycle is not exactly a tie. But it isn’t appropriate to call them “Completion” methods either as that implies something that it isn’t.</div><div class=""><br class=""></div><div class="">The actual objection I have is that when both are described as “Condorcet Methods”, then it’s too easy in the literature (and the blogs, and the wikipedia articles, particularly from Condorcet detractors) to paint with a broad brush and argue that all Condorcet Methods are flawed in some manner, same as how all other methods are “unfair” in some way, which ultimately does a disservice to the Condorcet Method. An election that has a Condorcet Winner is not unfair in those ways, compared to something like IRV or Plurality or Top-Two.</div><div class=""><br class=""></div><div class="">It might worth a survey of what a Smith Set actually *means*. I believe it signifies something valuable about the electorate, beyond just an indication that the election is “incomplete” and that we should apply some algorithm to divine a single winner from it.</div><div class=""><br class=""></div><div class="">(Regarding the typo in my README - I meant “should only be called a Condorcet *Method* if it is…”)</div></div></div></div><div class=""><br class=""></div><div class="">Curt</div><div class=""><br class=""></div></body></html>