... [...] ... I am not challenging this assertion. Rather, what I have tried to state is that IF a Condorcet-type method is advocated, that Kemeny-Young, alias...
... --I agree Markus Schulze's method is not very easy to describe, but it does have various advantages over Kemeny-Young: 1. Schulze has a reasonably...
... We still have that in rank voting ALL that the voter says is part of their assertion. If ALL that they had wanted was to favor D, they could have said...
Aggh, I blew the arithmetic again!! (This proves Kemeny-Young is a really bad voting method -- because I can't do it without making mistakes! Drives you...
... Range is quite ideal if "best possible" is defined e.g. as the sum of utilities as given by the voters and the voters are sincere. But in competitive...
... see my latest papers for formulations and proofs of theorems if the form that range is superior to all rank-order voting methods measured by Bayesian...
Since last month we have raced in circles on this one. Seems time for a summary. In last month's sample election (has changed since) we had A>D, B>A, and C>A...
... "However, all Condorcet methods including this one suffer from the "add top" or "add bottom" pathologies (actually I think his will suffer both) where X...
... --well, Fobes did not provide a defintion of "fair", he simply asserted Kemeny-Young was "always fair" whereas Condorcet was "not always fair." Whatever...
... I'm familiar with the "old" papers and simulations. Are there some new results in the latest ones? (Please be specific and tell what has been proven and...
I've changed my alias (from "cpsolver") to make it clear who I am. (This is my second post using Yahoo groups.) There have been several issues brought up in...
On Aug 2, 2009, at 4:11 AM, richard_fobes wrote: ... Here I suggest doing the candidates that are in the cycle - they are the ones with much support. ... Using...
... True. Yet keep in mind that this occurs only when there is not a Condorcet winner. Let's balance this comparison with two other comparisons not mentioned:...
Hallo, ... Actually, the described criterion is the so-called "consistency criterion". The Condorcet criterion and the consistency criterion are incompatible....
... In the 22-candidate election, with a limit of 3 preferences; NO candidate received a preference ranking of a majority of the voters. Does Condorcet even...
... --great to hear from you (R.Fobes)! ... --if abnormal(?) humans cast the votes [or anyhow if the votes are chosen by "the devil" to try to make it hard for...
... Even in a 3-candidate election, many voters can have a favorite to vote for, and be happy to vote ala Plurality - not caring to rank the others as if they...
Why not, rather than N!, consider only cycle members? For Primaries, getting rid of Plurality kills their major need but, with a good method for the general...
... --absolutely - excellent idea for reducing computing for finding Kemeny-Young optimal ordering. However, with random votes and large #candidates, every...
... Of course you are correct that I described the "consistency criterion" instead of "reinforcement." The reinforcement criterion says that if a method yields...
Dear Richard Fobes, actually, I don't even know why I should define single-winner election methods in terms of output rankings. When Barack Obama wins the...
... The Kemeny problem is not NP-hard. I would be happy to share my faster calculation method if there were a way to publish it without translating the...
Dear Richard Fobes, in the mathematical literature, the Kemeny-Young method is usually called "linear ordering problem". So when you want to get your paper...
If you really have a polynomial time algorithm for finding optimum Kemeny-Young ranking and/or winner, then I claim congratulations, you just proved P=NP and...
