<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=us-ascii">
<META content="MSHTML 6.00.2900.2769" name=GENERATOR></HEAD>
<BODY>
<DIV dir=ltr align=left><FONT face=Arial color=#0000ff size=2><SPAN
class=735140700-17112005>"<FONT face="Times New Roman" color=#000000
size=3>Candidates A, B and C all have 8 pairwise wins. D has 7.
Could D still be chosen as the winner by any "reasonable" method?</FONT><SPAN
class=735140700-17112005><FONT face=Arial color=#0000ff size=2> <FONT
face="Times New Roman" color=#000000
size=3>"</FONT></FONT></SPAN></SPAN></FONT></DIV>
<DIV dir=ltr align=left><FONT face="Times New Roman" color=#000000 size=3><SPAN
class=735140700-17112005><SPAN
class=735140700-17112005></SPAN></SPAN></FONT> </DIV>
<DIV dir=ltr align=left><FONT face=Arial color=#0000ff size=2><SPAN
class=735140700-17112005><SPAN class=735140700-17112005>Sure. D's 7 pairwise
wins could be by a large enough majority that the "extra" pairwise win that A,
B, and C have over the fringe candidate that beats D by 1 vote makes the "8" vs
"7" irrelevant.</SPAN></SPAN></FONT></DIV>
<DIV dir=ltr align=left><FONT face=Arial color=#0000ff size=2><SPAN
class=735140700-17112005><SPAN
class=735140700-17112005></SPAN></SPAN></FONT> </DIV>
<DIV dir=ltr align=left><FONT face=Arial color=#0000ff size=2><SPAN
class=735140700-17112005><SPAN class=735140700-17112005>This is kind of why I
don't like any counting method that BEGINS with the pairwise matrix. Some
systems would eliminated D when all of A, B, and C are real dogs that no
majority likes.</SPAN></SPAN></FONT></DIV>
<BLOCKQUOTE
style="PADDING-LEFT: 5px; MARGIN-LEFT: 5px; BORDER-LEFT: #0000ff 2px solid; MARGIN-RIGHT: 0px">
<DIV class=OutlookMessageHeader lang=en-us dir=ltr align=left><FONT
face=Tahoma><FONT size=2><SPAN class=735140700-17112005><FONT face=Arial
color=#0000ff> <FONT face=Tahoma
color=#000000>R</FONT></FONT></SPAN>ob brown<SPAN
class=735140700-17112005><FONT face=Arial
color=#0000ff> : </FONT></SPAN></FONT></FONT><BR></DIV>
<DIV></DIV>
<DIV>Hi, I haven't been around for a good while but some of you may
remember me.<BR><BR>I have recently been playing around with some stuff for
scoring condorcet elections, and ran into a question that seemed obvious but
maybe not:<BR><BR>Is it possible, in any of the Condorcet election methods
(beatpath, ranked pairs, etc), for someone who has fewer pairwise wins than
another candidate, to win the election regardless?<BR><BR>For instance, say
there is no Condorcet winner. Candidates A, B and C all have 8 pairwise
wins. D has 7. Could D still be chosen as the winner by any
"reasonable" method?<SPAN class=735140700-17112005><FONT face=Arial
color=#0000ff size=2> </FONT></SPAN><SPAN
class=735140700-17112005> </SPAN><BR><BR>Thanks,<BR>-rob<SPAN
class=735140700-17112005><FONT face=Arial color=#0000ff
size=2> </FONT></SPAN><SPAN
class=735140700-17112005> </SPAN></DIV></BLOCKQUOTE></BODY></HTML>