FPTP family theory, REDLOG shadowing

[DEMOREP1 at aol.com]

You wrote (16 Sep 1999):
> What of Condorcet, a topic of this mailing list?:
> An example: In an election with 2,152,370 candidates and
> 430,927 winners, how can it be certain that pairwise
> comparing of two candidates is an idea that ever had some
> mathematical importance on the fist day?, in France is it?.
--
D- The one office- single winner Condorcet case is the limiting case of the 
general case-

N test winners versus 1 test loser (with the other choices being deemed 
losers).
(such as electing 5 legislative body members in a district (1 effective vote 
per voter or electing 2 judges at large- 2 effective votes per voter).

The second or later choices from the losers may go to one of the test winners 
or the test loser.

If a test winner (in all of his/her test winner combinations) defeats each 
test loser, then he/she is a Condorcet winner.

Since there obviously may be less than N Condorcet Winners (especially with a 
large number of choices), some tiebreakers are worst head to head defeat 
causes a loss or the fewest YES votes causes a loss with a recheck of the 
test winners math.