I had actually heard of MMPO before - I do think it does fail later-no-help, though. Am I right? It would be better to find a method that passes both for this purpose... However, I wonder how well MMPO with a minimum first-place vote threshold would work...
On 4/25/07, Kevin Venzke <[EMAIL PROTECTED]> wrote:
Tim, --- Tim Hull <[EMAIL PROTECTED]> a écrit: > On this topic, does anyone know of a modified, > kind-of-Condorcet-but-not-quite method which preserves later-no-harm? > This may be interesting as a starting point... MinMax (pairwise opposition) satisfies LNHarm and usually gives results that are similar to those of Condorcet methods. It can behave strangely though, in electing a candidate with oddly few votes. The method elects the candidate who minimizes the largest number of votes against him in any pairwise contest. That is, it doesn't regard who actually wins each pairwise contest. Kevin Venzke ___________________________________________________________________________ Découvrez une nouvelle façon d'obtenir des réponses à toutes vos questions ! Profitez des connaissances, des opinions et des expériences des internautes sur Yahoo! Questions/Réponses http://fr.answers.yahoo.com ---- election-methods mailing list - see http://electorama.com/em for list info
---- election-methods mailing list - see http://electorama.com/em for list info
