Tony,
here's a simpler version of the Recursive Elimination Supervisor,
based on a suggestion of yours.
Step 1. Use the seed method in reverse to find the "Seed Loser" SL, from
among the N candidates.
Step 2. While the SL sits out, recursively supervise the seed method to
find an N-1 stage
Tony, I am a little worried that this simplification gives room for a
"Independence of Irrelevant Alternatives" problem to creep in.
Many methods suffer from this IIA problem (which says that the Winner
shouldn't change when some other candidate sits out) and it may be too
much to expect that we
Forest,
I found your scheme fascinating, and it worked with an
example or two I tried it with.
For three candidates, we first select one who wins
conventional IRV, and who we can figure is unlikely to be the
CL. We're not sure, but that isn't necessary, since the
principal purpose of this step
Any trivial method can correctly distinguish winner and loser in a two way
contest. How about a three way contest?
The answer is the same, yes, any old trivial method can correctly
distinguish winner and loser in a three way contest, IF (this is one of
those big IF's) the method is not just
