[EM] Benham-DAC/DSC

[Kristofer Munsterhjelm]

On 14.06.2022 18:54, Kristofer Munsterhjelm wrote:
> On 14.06.2022 01:25, Kevin Venzke wrote:
>> Hi Kristofer,
>>
>> Le dimanche 12 juin 2022, 06:35:17 UTC−5, Kristofer Munsterhjelm <km_elmet at t-online.de> a écrit :
>>> 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.
>>
>> Neither variant seems to satisfy DMTBR. I think DAC itself can only fail
>> DMTCBR if you'd say that Bucklin can.
> 
> It seems like it fails Condorcet itself, oops. (or my simulation code is
> bad)

Er, nevermind. It would just elect D directly from the first coalition
of every candidate - my simulator was bad and of course its trace was
also bad for the same reason.

-km