A variation on least additional votes:
Let f(A) be the fewest number of additional ballots (by friends of A) that
can turn A into the CW.
Let g(A) be the fewest number of additional ballots (by opponents of A)
that can turn A into the Condorcet Loser.
In other words g(A) is the same as the reve
Hello James,
I think your first guess ("A single ballot that lists this candidate as the first choice, with all others tied for last") is enough to do the job.
In the example I gave I was thus thinking of additions like
101: a>b>x>c
101: b>c>x>a
101: c>a>x>b
100: x
2: x
or
101: a>b>x>c
1
