<html><head></head><body><div class="ydpf8f5792fyahoo-style-wrap" style="font-family:Helvetica Neue, Helvetica, Arial, sans-serif;font-size:13px;"><div></div>
<div dir="ltr" data-setdir="false">I'm interested in your positive case for MinMax over Ranked Pairs (or River). To me it just seems essentially like a less sophisticated version of them.</div><div dir="ltr" data-setdir="false"><br></div><div dir="ltr" data-setdir="false">Toby</div><div><br></div>
</div><div id="ydp4a82fbcdyahoo_quoted_4145348956" class="ydp4a82fbcdyahoo_quoted">
<div style="font-family:'Helvetica Neue', Helvetica, Arial, sans-serif;font-size:13px;color:#26282a;">
<div>
On Thursday, 18 April 2024 at 19:43:33 BST, Richard, the VoteFair guy <electionmethods@votefair.org> wrote:
</div>
<div><br></div>
<div><br></div>
<div><div dir="ltr"><br clear="none"> > And why do you think that MinMax(wv) is better than either? Doesn't <br clear="none">it fail Smith and Clone Independence?<br clear="none"><br clear="none">See above about my lack of concern about the difference between "never" <br clear="none">and "almost never."<br><div class="ydp4a82fbcdyqt3430553015" id="ydp4a82fbcdyqtfd66675"><br clear="none"></div></div></div>
</div>
</div></body></html>