<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<div class="moz-cite-prefix"><br>
</div>
<div class="moz-cite-prefix">The American context of voting theory,
in a country where single-winner elections predominate, is
minimally democratic (maiorocracy, the tyranny of the majority: JS
Mill) so unlikely to provide general conclusions.</div>
<div class="moz-cite-prefix">And Condorcet is not an actual method,
but a cross-checking of the result for any given method. Anyway, I
suspect that this approach has turned into a search for the best
way to eliminate candidates. <br>
</div>
<div class="moz-cite-prefix">From my point of view, it is an
unnecessary task, because the exclusion of unprefered candidates
can be conducted in a same accurate, rational manner (using Meek
keep values) as the election of prefered candidates: Binomial STV,
actually FAB STV. This does away with discarding the votes of
candidates before the whole count has been completed. And thereby
does away with non-monotonicity (preferential illogic in the
count).</div>
<div class="moz-cite-prefix"><br>
</div>
<div class="moz-cite-prefix">from Richard Lung.<br>
</div>
<div class="moz-cite-prefix"><br>
</div>
<div class="moz-cite-prefix"> <br>
</div>
<div class="moz-cite-prefix"><br>
</div>
<div class="moz-cite-prefix">On 02/03/2019 21:20, Forest Simmons
wrote:<br>
</div>
<blockquote type="cite"
cite="mid:CAP29one53hBxkhGX3oesSVgv63j-RN_kRDZpqNFiP8_6yFQcDw@mail.gmail.com">
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<div dir="ltr">
<div>A few years back Jobst suggested "chain climbing" as a
seamless, Condorcet compliant way of selecting an alternative
from a given ordered list.</div>
<div><br>
</div>
<div>For example electing a winner from a list of candidates c1,
c2, ... given in decreasing order of approval.</div>
<div><br>
</div>
<div>Chain Climbing initializes a chain of candidates with the
last (least approved in this case) candidate in the list.
Then moving up the list each successive candidate "climbs the
chain" as far it can before being bumped off by a chain member
that defeats it. If it makes it all of the way to the top, it
is added to the top of the chain.<br>
</div>
<div><br>
</div>
<div>The candidate who ends up at the top of the chain is
elected.</div>
<div><br>
</div>
<div>Since a beats all candidate will never be defeated, the
method is Condorcet compliant. It also turns out to be clone
resistant and monotonic. <br>
</div>
<div><br>
</div>
<div>Another nice property is that it always selects from the
Banks set, a nice game theoretic subset set of the set of
uncovered candidates. <br>
</div>
<div><br>
</div>
<div>The biggest objection to this method is that when applied
to a list a list where c1 beats c2 beats c3, and c3 beats c1,
it elects c2. <br>
</div>
<div><br>
</div>
<div>Here's my proposed improvement:</div>
<div><br>
</div>
<div>Initialize the chain with c1. Move down the list instead
of up. For each successive candidate x (as we move down the
list) if possible, insert that candidate into the chain at a
point where it is beaten by every candidate above it and is
not defeated by any candidate below it. If not possible,
discard it.</div>
<div><br>
</div>
<div>After going through the entire list (top to bottom)
inserting new candidates where possible into the totally
ordered chain, we end up with a maximal totally ordered chain
of candidates (ordered by pairwise defeat) The candidate at
the top fo the completed chain (the one who is not defeated by
any of the others) is elected.</div>
<div><br>
</div>
<div>It is easy to show that this method has all of the nice
properties of chain climbing, but retains more of the spirit
of the original list..</div>
<div><br>
</div>
<div>For example in the A>B>C example above it elects A.<br>
</div>
<div><br>
</div>
<div>What do you think?</div>
<div><br>
</div>
<div>Forest<br>
</div>
<div><br>
</div>
<div><br>
</div>
<div><br>
</div>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<pre class="moz-quote-pre" wrap="">----
Election-Methods mailing list - see <a class="moz-txt-link-freetext" href="https://electorama.com/em">https://electorama.com/em</a> for list info
</pre>
</blockquote>
<p><br>
</p>
</body>
</html>