[EM] The Unique Winning Alliance method

[Rob Speer]

On Mon, Aug 04, 2003 at 08:52:07PM +0200, Markus Schulze wrote:
> Example:
> 
>    A  B  C  D
> A  0  1 -5  4
> B -1  0  6 -2
> C  5 -6  0 -3
> D -4  2  3  0
> 
> The Nash Set is ACD. SSD, Ranked Pairs, MinMax, Kemeny-Young, and
> Smith//Borda would choose candidate B.

I admire whatever method you've been using to find the Nash Set, but it
seems to have broken down there. The Nash Set for that matrix is ABC.

Incidentally, that breaks the guess I just made at a simpler algorithm
to find the Nash set. I can't see a clear reason why D is excluded.
-- 
Rob Speer