<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
</head>
<body>
<p><br>
Similar but a bit more complicated is Double Defeat, Benham.
That is my candidate for most Burial resistant good Condorcet
method.<br>
<br>
</p>
<blockquote type="cite" style="color: #007cff;">*Voters strictly
rank from the top however many candidates they wish and may also
indicate an approval cutoff (possibly by ranking a "Approve none
below" virtual candidate).
<br>
<br>
Any candidate pairwise beaten by a more approved candidate is
disqualified. Among the not disqualified candidates elect a
candiate that pairwise beats all the others. If there isn't one
then do Hare-style eliminations until there is one among the
remaining candidates. That candidate is the winner.*
<br>
</blockquote>
<div class="moz-cite-prefix"><br>
Chris B.<br>
<br>
<br>
</div>
<div class="moz-cite-prefix">On 15/10/2024 11:25 pm, Kristofer
Munsterhjelm wrote:<br>
</div>
<blockquote type="cite"
cite="mid:3f868e09-bf28-5240-7d6e-64b1bb195b81@munsterhjelm.no">On
2024-10-14 07:02, Chris Benham wrote:
<br>
<blockquote type="cite">
<br>
It looks like there isn't any wiki page for Double Defeat, Hare.
<br>
</blockquote>
<br>
Added, thanks :-)
<br>
<br>
I've also added Steve's VPR and VPR-MAM methods.
<br>
<br>
-km
<br>
</blockquote>
</body>
</html>