<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META NAME="Generator" CONTENT="MS Exchange Server version 6.5.7226.0">
<TITLE>Re: [Condorcet] Proposed Statutory Rules for DMC</TITLE>
</HEAD>
<BODY>
<DIV id=idOWAReplyText25306 dir=ltr>
<DIV dir=ltr><FONT size=2>Dear Jobst,</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Here's a method that puts all of its eggs in the 2nd
place complaints basket:</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Elect the alternative X with the least pairwise
opposition from the alternative X' that would win if the winning alternative X
were withdrawn.</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Does this method actually satisfy immunity
from second place complaints?</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Imagine how easy it would be to write the statutory
rules for this method:</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Article 1. Use ballots that allow the voters to
grade the alternatives with letters from A to Z. The default grade is
Z.</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Article 2. Elect the alternative X for
which the alternative X' that would win by the same rules if X were
withdrawn has the fewest ballots on which it X' receives a grade
nearer the front of the alphabet than X.</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Article 3. Settle any ties at any stage of the
recursion by existing laws for breaking ties.</FONT></DIV>
<DIV dir=ltr><FONT size=2></FONT> </DIV>
<DIV dir=ltr><FONT size=2>Forest</FONT></DIV></DIV>
</BODY>
</HTML>