Markus Schulze a écrit :
> Dear David,
>
> you wrote (18 Dec 2003):
> > I know a few 'shortest path' algorithm like "Dijkstra" and
> > "Bellman-Ford". Dijkstra is having an 0(n*Log(n)) complexity (in time)
> > and for the other... I don't remember but it is a more distributed
> > algorithm.
If I
Dear David,
you wrote (18 Dec 2003):
> I know a few 'shortest path' algorithm like "Dijkstra" and
> "Bellman-Ford". Dijkstra is having an 0(n*Log(n)) complexity (in time)
> and for the other... I don't remember but it is a more distributed
> algorithm.
Bellman-Ford, Dijkstra, and Floyd have the p
Ernest Prabhakar wrote:
Can we chill? We're all Condorcet-lovers, after all. Mike probably
used the term Floyd inappropriately. Markus probably cited a poor
example. Everybody makes mistakes.No injury, no foul.
I love flame war... especially those where I don't understand a word.
I su
For me two paramount criteria are
(1) simplicity of optimal or near optimal strategy, and
(2) as much voting power as possible consistent with (1).
There are various possible definitions of "voting power," but it should
have something to do with the probability of one ballot or set of ballots
be
Dear Craig,
you wrote (18 Dec 2003):
> Let's consider the algorithm itself. Here I quote from the VM 17
> PDF file:
>
> ---
> : Suppose that d[X,Y] is the number of voters who
> : strictly prefer candidate X to candidate Y. Then the
> : Smith set is the smallest non-empty set of candid
I see that Marcus/Markus Schulze posted in 2 lines. While we wait
for the rest of the clipped communication (not conversation) I
post up some ideas. As ever, guessing is second to a catechistic
approach (with mind-changing over the answers allowed).
--
Mr Schulze d
Hi guys,
On Dec 18, 2003, at 7:32 AM, Markus Schulze wrote:
You wrote (18 Dec 2003):
Idiot, why don't you read the quoted passage above, from my e-mail.
Did I
deny that I'd called my implementation the Floyd algorithm? The only
thing
that I denied having called "the Floyd algorithm" was your
po
Dear Mike,
you wrote (17 Dec 2003):
> Wrong. I don't call that the Floyd algorithm.
I wrote (17 Dec 2003):
> You do. You call that the Floyd algorithm
> (http://electionmethods.org/CondorcetSSD.py):
>
> > Determine "beatpath" magnitudes array using the Floyd Algorithm:
> > Def[i,j] will be the ma
I'd said, spelling it out very carefully for Markus:
You posted a little fragment of a Python program. And, in that fragment,
some of the lines weren't even complete. You said I called that the Floyd
algorithm. I replied that I have never called that line-truncated fragment
anything. Did i call th
Dear participants,
the correct version of the Floyd algorithm can be found in
Section 4 and in Appendix 3 of my paper "A New Monotonic
and Clone-Independent Single-Winner Election Method":
http://groups.yahoo.com/group/election-methods-list/files/nmciswem.pdf
Markus Schulze
Election-methods
Dear Mike,
you wrote (17 Dec 2003):
> Wrong. I don't call that the Floyd algorithm.
I wrote (17 Dec 2003):
> You do. You call that the Floyd algorithm
> (http://electionmethods.org/CondorcetSSD.py):
>
> > Determine "beatpath" magnitudes array using the Floyd Algorithm:
> > Def[i,j] will be the ma
Markus said:
Mike,
you wrote (17 Dec 2003):
Wrong. I don't call that the Floyd algorithm.
You do. You call that the Floyd algorithm
(http://electionmethods.org/CondorcetSSD.py):
I reply:
Wrong again. You aren't being entirely clear with us about exactly what you
mean by"that". Perhaps you're c
Here is an algorithm to implement BeatpathWinner. It seems to me that
someone called the strongest beatpaths algorithm the Floyd algorithm. But
maybe not. When Markus said that the fragment of code that he quoted didn't
work to find the shortest path, he may have been referring to the overall
a
Dear Mike,
you wrote (17 Dec 2003):
> Wrong. I don't call that the Floyd algorithm.
You do. You call that the Floyd algorithm
(http://electionmethods.org/CondorcetSSD.py):
> Determine "beatpath" magnitudes array using the Floyd Algorithm:
> Def[i,j] will be the maximum beatpath magnitudes array
Either Markus or Craig Carey, I'm not quite sure which, said:
However, Mike Ossipoff always describes the Floyd algorithm as
follows:
> for i in range(N)
> for j in range(N)
> for k in range(N)
>low=min(B[A(i,j)],B[A(j,k)]
>if low>B[A(i,k)]
>B[A(i,k)]=low
Wrong. I don't call that the
15 matches
Mail list logo
