[EM] Why I Think Sincere Cycles are Extremely Unlikely in

[Kevin Venzke]

Hi Forest,

--- En date de : Lun 15.11.10, fsimmons at pcc.edu <fsimmons at pcc.edu> a écrit :
> De: fsimmons at pcc.edu <fsimmons at pcc.edu>
> Objet: Re: [EM] Why I Think Sincere Cycles are Extremely Unlikely in
> À: election-methods at lists.electorama.com
> Date: Lundi 15 novembre 2010, 15h38
> 
> > From: Juho 
> 
> [snip].
>  
> > On the other hand we know that all Condorcet methods
> are 
> > vulnerable at 
> > least to the burying strategy. 
> 
> All Condorcet Methods?  Or all deterministic Condorcet
> Methods?

I would say all... LNHelp is basically a subset of a "burial resistance"
criterion and you can't get a Condorcet method to satisfy LNHelp even
using randomness.

You may come up with something that in practice is very difficult to try
to game (and we do try), but there's no invulnerability.

Kevin