[EM] Benham-DAC/DSC

[Kristofer Munsterhjelm]

Here's a modification to DAC and DSC inspired by Benham's method:

Intersect coalition sets as in DAC and DSC. But before intersecting with 
a set, check if the current set contains a candidate who beats everybody 
else in it pairwise. If so, elect this candidate.

It's clearly Condorcet (the initial set is the set of all candidates). 
It's probably not DMTBR (because DAC and DSC aren't.) Is it Smith? For a 
Smith failure to happen, the set at some stage needs to have more than 
one Smith candidate, and then they all get eliminated by the next 
intersection. I don't know if that's impossible - or possible.

-km