Condorcet(x( ))

[DEMOREP1 at aol.com]

Steve Eppley wrote---
---
Here's an example showing how x can affect the outcome.
Suppose with two ballots remaining to be tallied, the results 
so far are:
  A losing to B (45 to 51)
  B losing to C (40 to 52)
  C losing to A (43 to 53)

If the two remaining ballots are both {A=B > C}, who wins?  

It depends on x.
With x=0:
  A lost to B (45 to 51)
  B lost to C (42 to 52)
  C lost to A (43 to 55)
  A wins with smallest worst defeat = 51.
With x=.5:
  A lost to B (46 to 52)
  B lost to C (42 to 52)
  C lost to A (43 to 55)
  This is a tie between A and B, with smallest worst defeat = 52,
    so some other tie-breaking method would pick one of them.
With x=1:
  A lost to B (47 to 53)
  B lost to C (42 to 52)
  C lost to A (43 to 55)
  B wins with smallest worst defeat = 52.
----End of Eppley excerpt

If any group of N voters votes A=B>C, then such votes are obviously
A N
B N
C 0
A N, B N
A N, C 0
B N, C 0
or
A N = B N
A N > C 0
B N > C 0
Thus, x =1.

However, the total votes recorded in the A and B combination will be more
than the number of ballots (which may seem strange to the average voter). N
votes for A plus N votes for B = 2 times N votes recorded. The question is
whether or not tie rankings will be allowed. If tie votes are not allowed,
then there obviously will be less voter confusion and the vote totals in any
combination will be equal to the number of ballots.